### 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 3: Comparison of decoding times. Decoding Inefficiency, Tornado Z

1998

"... In PAGE 14: ... Therefore, in computing the decoding time per block, we assume that half the packets received are redundant encoding packets. Based on the data previously presented in the Cauchy codes column of Table3 , we approximate the decoding time for a block of k source data packets by k2=31250 seconds. To compute the running time for Tornado Z, we simply use the decode times for Tornado Z as given earlier in Table 3.... ..."

Cited by 281

### Table 3: Comparison of decoding times.

"... In PAGE 7: ... Therefore, in com- puting the decoding time per block, we assume that half the packets received are redundant encoding packets. Based on the data previously presented in the Cauchy codes column of Table3 , we approximate the decoding time for a block of k source data packets by k 2 =31250 seconds. To compute the running time for Tornado Z, we simply use the decode times for Tornado Z as given earlier in Table 3.... ..."

### Table 3: Comparison of decoding times.

"... In PAGE 8: ... Therefore, in computing the decoding time per block, we assume that half the packets received are redundant encoding packets. Based on the data previously presented in the Cauchy codes column of Table3 , we approximate the decoding time for a block of k source data packets by k2/31250 seconds. To compute the running time for Tornado Z, we simply use the decode times for Tornado Z as given earlier in Table 3.... ..."

### Table 2. Results of the HuffDecode benchmark on Sparc and Athlon, time and growth

2004

"... In PAGE 6: ... Huffman decoder source As before, the code is evaluated on the SPARC and Athlon targets. For each target, Table2 shows three versions: The original, a fully-expanded ATS variant, and finally an optimized ATS version. The latter was subjected to agressive propagation, replacing constant accesses to constant memory locations with their contents.... ..."

Cited by 1

### Table 3: Comparison of decoding times. Decoding Inefficiency, Tornado Z

"... In PAGE 14: ... Therefore, in computing the decoding time per block, we assume that half the packets received are redundant encoding packets. Based on the data previously presented in the Cauchy codes column of Table3 , we approximate the decoding time for a block of k source data packets by k2=31250 seconds. To compute the running time for Tornado Z, we simply use the decode times for Tornado Z as given earlier in Table 3.... ..."

### Table 1. Comparison between decoding time for RS codes and Tornado codes, a class of Fountain codes

"... In PAGE 4: ...) which is very essential in our case, since we are considering broadband communications with high rates. Table1 [7] shows comparison between decoding time for RS code and Tornado code, a class of Fountain code ... ..."

### Table 5.3: Results from the comparison of decoding over the GEC using BAMNC approx- imation decoders versus the GEC decoder. For these simulations a length 105, rate-1/2, (3,6)-regular code was used with a maximum of 200 iterations for decoding.

2005

### Table 3 Comparison of coding gains and decoding search space per decoder of unitary DSTM for eight transmit antennas

"... In PAGE 13: ... 10 12 14 16 18 20 22 24 10-5 10-4 10-3 10-2 10-1 100 BL ER SNR Rate-1/2 O-STBC 2bps/Hz [7] SP(2) 1.94bps/Hz [6] Rate-1 QO-STBC 2bps/Hz [proposed] Rate-3/4 O-STBC SP 2bps/Hz [proposed] Figure 2 Block error rates of different DSTM schemes for four tx and one rx antennas Table3 compares the coding gain and decoding search space per decoder of three unitary DSTM schemes for eight transmit antennas. The first DSTM is our proposed DSTM based on a rate-1/2 O- STBC with spherical code.... In PAGE 14: ... Decoding it requires four parallel decoders, each with a search space of 8. Table3 shows that both our proposed DSTM schemes have higher coding gain than the third scheme. Interestingly, among our two proposed schemes, the one based on O-STBC with spherical code has a higher coding gain, but also larger decoding search space, than that based on QO-STBC (unlike the case of four transmit antennas).... In PAGE 14: ... Interestingly, among our two proposed schemes, the one based on O-STBC with spherical code has a higher coding gain, but also larger decoding search space, than that based on QO-STBC (unlike the case of four transmit antennas). In Table3 we also demonstrate that our proposed QO-STBC DSTM scheme can be extended to eight transmit antennas and still maintains pair-wise decoding complexity. Such extension to eight transmit antennas is not possible for the non-linear DSTM reported in [16].... In PAGE 15: ... 15 6 8 10 12 14 16 18 20 10-4 10-3 10-2 10-1 100 BL ER SNR Rate-1/2 O-STBC (8PSK) [7] Rate-3/4 QO-STBC [proposed] Rate-1/2 O-STBC SC [proposed] Figure 3 Block error rates of for eight tx and one rx antennas at 1.5 bits/sec/Hz The decoding performance of the three DSTM schemes from Table3 are compared in Figure 3. We can see that the best-performing scheme is our proposed DSTM based on rate-1/2 O-STBC with spherical code, followed by our proposed DSTM based on rate-3/4 QO-STBC, and lastly the DSTM based on rate-1/2 square O-STBC from [7].... ..."

### Table 2: The decoding times of the component algorithms for a test case of decoding a RS(255,239) code with m = 4.

2003

Cited by 6