### Table 2. Covering radii of Reed-Muller codes

2003

Cited by 4

### TABLE II APPLICATION OF THEOREM 4 TO REED-MULLER CODES.

2006

Cited by 2

### TABLE II APPLICATION OF THEOREM 4 TO REED-MULLER CODES.

2006

Cited by 2

### Table 2: Properties of some elected codes

"... In PAGE 3: ... Ideally, d would be as large as n ? k + 1, but this can not be achieved for \sophisti- cated quot; values for n and k. Table2 gives an overview of what combinations of n, k and d can be achieved for linear block codes over GF(2).1 We have chosen Reed-Muller codes of order 1 [4] for our erasure correction implementation.... ..."

### Table 6: Benchmark examples for linear codes

1994

"... In PAGE 6: ... If the columns of matrix G are interpreted as the elements of the set of constants, the minimization of addition to produce the set of constants (65535, 21845, 13107, 3855, 255, 4369, 1285, 85, 771, 51, 15) is equivalent to minimizing the number of additions needed for encoding using the Reed-Muller code. Table6 shows the set of error-correction benchmarks [Rhe89] on which we applied the MCM approach. The average and median reductions in the number of additions is by factors of 1.... ..."

Cited by 14

### Table 2. Codes used by Reddy amp; Pai for relative distances.

"... In PAGE 4: ...ave the shortest codeword, which in most of the cases consists of just one bit, i.e. either 0 or 1, or two bits. But according to Table2 it is impossible to have a short codeword for relative distance 0, because in this case the condition explained previously cannot be satisfied. 3) Since the size of the blocks has been chosen to be , when the RAC method is used, there is a need to define the codes for 16 positive relative distances, and not just for 8.... In PAGE 4: ... In any case there are two possibilities: a) They have defined relative distances and used them but they just did not mention it in the paper. In this case, either their codes are all wrong like those in Table2 , or the authors use very long codewords, because the condition mentioned for the coding must not be contradicted at least for the rest of the codewords. But with such long codewords it is impossible to obtain a good com- pression factor.... In PAGE 5: ... To make the problem clear, assume a part of a block after Reed-Muller coding is as in Fig. 2 According to Table2 the code for element A must be 01 because the relative distance is +2, and the same code will be chosen for element B because the relative distance for B is +2 as well. Since A and B are adjacent transition elements, the code for them will be 0101.... In PAGE 5: ... 2) The authors have mentioned that depending on the probability of the occurrence, the RAC dis- tances (0, +1, -1) are given special code words. According to Table2 the authors have defined the codewords for +1 and -1 but not for 0. In any case the obvious thing is that all the codes must be C E .... In PAGE 6: ... The Problems with step (c) In this step there are some obvious mistakes, and in the following these mistakes are dis- cussed: The authors have used Relative Address Coding (RAC) to code the data after performing the Reed-Muller transform. The code used by Reddy amp; Pai is in Table2 . These codes are short, and it seems that the reason for obtaining a good compression factor is to use such short codes.... ..."

### Table 2. Codes used by Reddy amp; Pai for relative distances.

"... In PAGE 4: ...ave the shortest codeword, which in most of the cases consists of just one bit, i.e. either 0 or 1, or two bits. But according to Table2 it is impossible to have a short codeword for relative distance 0, because in this case the condition explained previously cannot be satisfied. 3) Since the size of the blocks has been chosen to be , when the RAC method is used, there is a need to define the codes for 16 positive relative distances, and not just for 8.... In PAGE 6: ... The Problems with step (c) In this step there are some obvious mistakes, and in the following these mistakes are dis- cussed: The authors have used Relative Address Coding (RAC) to code the data after performing the Reed-Muller transform. The code used by Reddy amp; Pai is in Table2 . These codes are short, and it seems that the reason for obtaining a good compression factor is to use such short codes.... ..."

### Table 2: Muller C-element functionality.

"... In PAGE 22: ... Each Muller C-element manages one rail of the dual-rail coding, copying the input to the output whenever the previously output value has been acknowledged. Table2 describes the behavior of this component in each possible... ..."

### Table 2: Muller C-element functionality.

"... In PAGE 22: ... Each Muller C-element manages one rail of the dual-rail coding, copying the input to the output whenever the previously output value has been acknowledged. Table2 describes the behavior of this component in each possible... ..."