### Table Page 1. Error-Correcting Codes ............................... 11

### Table 2. An Error Correcting Codes (ECC) Matrix

"... In PAGE 7: ... Dynamic Fusion Problem Viewed as a Factorial Hidden Markov Model (FHMM) We also define the ECC matrix ECC = [emn] as the diagnostic matrix (D-matrix), which represents the full-order dependency among failure sources and classifiers. Table2 shows an ECC matrix as an illustrative example (8 failure sources and 4 classifiers). Table 2.... ..."

### Table 3: A 15-bit error-correcting output code for a ten-class problem.

1995

"... In PAGE 4: ... Table3 shows a 15-bit error-correcting code for the digit-recognition task. Each class is represented byacodeword drawn from an error-correcting code.... In PAGE 4: ... If we make only b d,1 2 c errors, the nearest codeword will still be the correct codeword. #28The code of Table3 has minimum Hamming distance seven and hence it can correct errors in any three bit positions.#29 The Hamming distance between anytwo codewords in the one- per-class code is two, so the one-per-class encoding of the k output classes cannot correct any errors.... In PAGE 7: ... 2.3 Error-Correcting Code Design We de#0Cne an error-correcting code to be a matrix of binary values such as the matrix shown in Table3 . The length of a code is the number of columns in the code.... ..."

Cited by 353

### Table 3: Encoder/decoder gate counts and delay for single error-correcting boundary shift codes.

2004

"... In PAGE 4: ... These circuits can be generalized in a straightforward manner for larger single error-correcting codes. Gate counts and maximum circuit depths are given in Table3 for a range of bus sizes and closed form expressions are given for the general case. For large bus sizes the increased circuit depth may lead to signif- icant delay.... ..."

Cited by 7

### Table 2: Comparison of boundary shift codes and optimal self shielding error-correcting codes.

2004

"... In PAGE 5: ... As long as the source and destination are synchronized, no error propagation will occur. A summary of advantages and drawbacks of the codes presented in this paper are shown in Table2 . The boundary shift codes have a higher rate (i.... ..."

Cited by 7

### TABLE II COMPARISON OF BOUNDARY-SHIFT CODES AND OPTIMAL SELF SHIELDING ERROR-CORRECTING CODES.

### Table 2: Division of space according to Error-Correction Code (ECC) information

2005

### Table 3. Number of additions/subtractionscompar- ison for some error-correction benchmarks.

2003

"... In PAGE 6: ... We performed some other comparisons on some error- correcting codes from [17] and [13]: the a43a33a5 a43 Hadamard matrix transform, a58 a15a18a19a25a54a18a15a16a15a37a62 Reed-Muller, a58a28a15a24a36a25a54a76a72a16a62 BCH and a58 a7 a17 a54a31a15 a7 a54 a43 a62 Golay codes. The comparison with the previous works in [17] and [13] is presented in Table3 and the corre- sponding synthesis results are presented in Table 4. These results show that for very simple operators such as a small BCH code, some improvements are still possible.... ..."

Cited by 5

### Table 1: Error correcting code for n = 8 classes

"... In PAGE 2: ... It is coded in a distributed representation of l outputs from all classi ers. Table1 shows an example of an error correcting code for n =8 classes with l =5codewords. The code words are the columns of the table.... ..."