### Table1 Automorphisms for different FKS curves, which provide maximum length cyclic sub-codes. Comparison of code length between the cyclic FKS sub-codes and Reed-Solomon codes. The length gain from the RS code to the FKS sub-code.

"... In PAGE 3: ... We can design a code of maximum length by exhaustive search over the automorphisms i defined in the theorem 5. Table1 shows the automorphisms found and the equations (see (1)) of the respective curves for some finite fields. It compares the length of Reed-Solomon codes with the length of the cyclic FKS sub-codes of maximum length given by the respective automorphisms.... In PAGE 3: ...The results presented in the Table1 show that the sequences obtained by the method described here are longer than the se- quences from Reed-Solomon codes for s gt; 1. Unfortunately, the code length gain decreases for greater finite fields.... ..."

### TABLE 1. LDPC CODES CONSIDERED FOR MAGNETIC RECORDING APPLICATIONS Finite Field

2001

Cited by 11

### Table 4. Timings for point multiplication on the elliptic curve over the finite field with characteristic p160, and p240

### Table 2: Examples of cyclic codes over F2 + uF2

"... In PAGE 8: ... We present some examples of cyclic codes over R with good minimum distance properties in Tables 2 and 3. In Table2 , dLee corresponds to the exact minimum Lee distance. We have used the results from minimum distance tables of binary cyclic codes from [11] to compute the exact dLee.... ..."

### Table 3: Examples of cyclic codes over F2 + uF2 of length 127

"... In PAGE 8: ... We have used the results from minimum distance tables of binary cyclic codes from [11] to compute the exact dLee. The results in Table3 have been computed by the BCH-like bound in Theorem 7. Remark 1 The above theorem holds good in the Z4-cyclic codes context also.... ..."