论文信息 - Minimum cyclotomic coset representatives and their applications to BCH codes and Goppa Codes

Minimum cyclotomic coset representatives and their applications to BCH codes and Goppa Codes

We consider the minimum cyclotomic coset representatives and derive some of their properties. The results allow more precise estimates of the dimension of Bose-Chaudhuri-Hocquenghem (BCH) and classical Goppa codes of a given designed minimum distance, and more precise estimates of the true designed distance of BCH codes and the minimum distance of classical Goppa codes.

Dian-Wu Yue | Guang-Zeng Feng

[1] Henry B. Mann,et al. On the Number of Information Symbols in Bose-Chaudhuri Codes , 1962, Inf. Control..

[2] Neil J. A. Sloane,et al. The theory of error-correcting codes (north-holland , 1977 .

[3] Daniel Augot,et al. Idempotents and the BCH bound , 1994, IEEE Trans. Inf. Theory.

[4] Hongbo Zhu,et al. On the minimum distance of composite-length BCH codes , 1999, IEEE Communications Letters.

[5] Masao Kasahara,et al. Further results on Goppa codes and their applications to constructing efficient binary codes , 1976, IEEE Trans. Inf. Theory.

[6] David M. Mandelbaum. Two applications of cyclotomic cosets to certain BCH codes (Corresp.) , 1980, IEEE Trans. Inf. Theory.

[7] Yue Dianwu,et al. On the dimension and minimum distance of BCH codes over GF(q) , 1996 .