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

IEEE Transactions on Information Theory

Volumn 46, Issue 7, 2000, Pages 2625-2628

  Yue, Dian Wu ^a   Feng, Guang Zeng ^b  

^a Jiangsu Key Laboratory of Wireless Communications   (China)

^b UNIVERSITY OF MANITOBA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DECODING; DIGITAL ARITHMETIC; MATHEMATICAL OPERATORS; MATRIX ALGEBRA; POLYNOMIALS; THEOREM PROVING;

BOSE-CHAUDHURI-HOCQUENGHEM CODES; GOPPA CODES; MINIMUM CYCLOTOMIC REPRESENTATIVES; MINIMUM DISTANCE;

BINARY CODES;

EID: 0034318231     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.887870     Document Type: Article

References (10)

1. F. J. Mac Williams and N. J. A. Sloane, The Theory ofError-Corrorecüng Codes, Amsterdam, The Netherlands: North-Holland, 1977.
2. D. M. Mandelbaum, Two applications of cyclotomic cosets to certain BCH codes "IEEETrans. Inform. Theory, vol. IT-26, pp. 737-738, Nov. 1980.
3. D. Augot and N. Sendrier, Idempotents and the BCH bound, IEEE Trans. Inform. Theory, vol. 40, pp. 204-207, Jan. 1994.
4. D.-W. Yue and Q.-J. Ji, On the lower bounds on minimum distance for Goppa codes and for alternant codes, J. China Inst. Commun., vol. 12, no. 3, pp. 10-16, 1991. In Chinese.
5. D.-W. Yue, On the dimension of Goppa codes, J. Electron., vol. 13, pp. 211-216, 1991. In Chinese.
6. D.-W. Yue and Z.-M. Hu, On the dimension and the minimum distance of BCH codes over GF(q)," J. Electron., vol. 18, pp. 263-269, 1996. In Chinese.
7. D.-W. Yue and H.-B. Zhu, On the minimum distance of compositelength BCH codes, IEEE Commun. Lett., vol. 3, pp. 269-271, Aug. 1999.
8. G.-L. Feng, Generalization of lower bound on the minimum distance and upper bound on the number of parity check digits for Goppa codes, Acta Electron. Sinica, vol. 11, no. 2, pp. 66-72, 1983. In Chinese.
9. Y Sugiyama, M. Kasahara, S. Hirasawa, and T. Namekawa, Further results on Goppa codes and their applications to constructing efficient binary codes, IEEE Trans. Inform. Theory, vol. IT-22, pp. 518-526, Sept. 1976.
10. H. B. Mann, On the number of information symbols in Bose-Chaudhuri codes, Inform. Contr., vol. 5, pp. 153-162, 1962.