### Table 1. Some Cyclic Codes and Their Corresponding Number of Terms Required for Decoding.

"... In PAGE 16: ... Although it is not listed in [25] as a majority decodable code, the above result confirms that BCH (15,2) can be decoded by majority logic. Table1 lists some cyclic codes and their corresponding number of terms required for decoding. To specify a code, the code length n, number of information bits k, the minimum distance d, the minimum distance guaranteed by the BCH bound dBCH, and the exponents of the roots of the generator polynomial are tabulated like that in [2].... In PAGE 17: ... That is, if a code is designed to correct t0 error, in some cases it may have a minimum distance d = dBCH gt; 2t0+1; that is not all correctable errors can be corrected by the algorithm. One example is the (21,7) code presented in Table1 . Thus the following comparison is made between a Meggitt decoder and a neural decoder.... In PAGE 18: ... In other words, efficient decoding structures of long length codes that can be found by the proposed approach are still limited by the available memory size and the affordable computation time. There are two ways to expand the practical value of the proposed approach to find larger length codes : First, longer codes can be constructed from the codes of Table1 by the techniques of interleaving. To get a (bn,bk) code from an (n,k) code, taking any b codewords from the original code and merge the codewords by alternating the symbols.... ..."

### Table III: Highest achievable minimal distance d in any [[n; k; d]] quantum-error-correcting code. The symbols are explained in the text. n n k 0 1 2 3 4 5 6 7

1998

Cited by 105

### TABLE I A COMPARISON BETWEEN THE CORRECTION CAPABILITIES OF EVEN-ODD CODES AND OPTIMAL BURST ERROR CORRECTING CODES

### Table 2: Random coding BER, N=100 K=50. 100

"... In PAGE 8: ...able 3: Random coding, N=200 K=100. 100 samples. is given #28indicated by cases when both BBMB and BFMB solve all problems#29 the average running time of BFMB is never worse than BBMB and often better by a factor of 5-10. In Table2 we report the Bit Error Rate #28BER#29 for the same problems and algorithms as in Table 1. BER is a standard measure used in the coding literature denoting the fraction of input bits that were decoded incorrectly.... ..."

### Table 4. Experiments on [256;129; 14] code using Leon apos;s algorithm [n; k]-random linear code can be estimated by the following formula: N(n; k; w) ?n w

"... In PAGE 17: ....e. recovering an error vector of weight 14. Table4 gives the experimental results obtained with Leon apos;s algorithm. For each set of parameters, 1000 computations have been made.... ..."

### Table 4. Experiments on [256;129; 14] code using Leon apos;s algorithm [n; k]-random linear code can be estimated by the following formula: N(n; k; w) ?n w

"... In PAGE 19: ....e. recovering an error vector of weight 14. Table4 gives the experimental results obtained with Leon apos;s algorithm. For each set of parameters, 1000 computations have been made.... ..."

### Table 1: Energy efficiency factors of error correcting codes for n-k=2.

1998

Cited by 10

### Table IV: Putative extremal quantum-error-correcting codes ((n; K; d)) in which K is a power of 2.

1998

Cited by 105