### Table 3: Decoding random [256; 128; 29]-binary codes de nition 3 The primitive binary narrow-sense BCH code of length n = 2m ? 1 and de- signed distance , denoted by B(n; ), is the largest binary cyclic code of length n having zeros

### Table 1: BCH codes of length 511

"... In PAGE 9: ... Some other minimum distance are known for length 511. Table1 gives a list of them as well as the way they were found. We try to give as reference the rst author known to us which explicitly gives the code and its true minimum distance.... ..."

### Table 10:1 highlights several possible limitations of the productivity equation. Notice how the formula addresses only the first two examples; that is, it can be used only to measure the productivity of programmers during coding. It is irrelevant for assessing the productivity of other software personnel performing other development tasks. In fact, whether the formula actually measures programmer productivity during software development in the intuitive sense discussed earlier is also highly questionable. We are not suggesting that the productivity equation should never be used. Rather, we suggest that the equation should not be defined and used as the only measure of (personnel) productivity, as it captures only a narrow sense of what we intuitively mean about productivity (Fenton amp; Pfleeger, 1996).

"... In PAGE 7: ...able 9:7 Full Function Point Functional Types.................................................................................... 74 Table10 :1 Productivity of resources.... In PAGE 82: ...Chapter 10 Department of Informatics Productivity, Quality and Performance 82 activity, as opposed to design or testing. Table10 :1 shows some examples of typical processes and products we should consider when measuring the productivity of certain typical resources. We have also added a column for relevant resources used,... ..."

### Table 1. The multivariate prediction of evolutionary response after one generation of selection, CovA[w, z], for three traits measured on three populations of C. fasciculata reared in three environments. Univariate pre- dictions and narrow-sense heritabilities, h 2 (6), from separate analyses are

### Table 4.1. Some BCH codes

2002

### TABLE III APPLICATION OF THEOREM 4 TO PRIMITIVE BCH CODES.

2006

Cited by 2

### TABLE III APPLICATION OF THEOREM 4 TO PRIMITIVE BCH CODES.

2006

Cited by 2

### 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.... ..."