Abstract
In this paper, only narrow-sense primitive BCH codes over GF(q) are considered. A formula, that can be used in many cases, is first presented for computing the dimension of BCH codes. It improves the result given by MacWilliams and Sloane in 1977. A new method for finding the dimension of all types of BCH codes is proposed. In second part, it is proved that the BCH bound is the leader of some cyclotomic coset, and we guess that the minimum distance for any BCH code is also the leader of some cyclotomic coset.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
F. J. MacWilliams, N. J. A. Sloane, The Theory of Error-correcting Codes. Amsterdam: North-Holland, 1977, 201–267.
D. Yue, Q. Ji, On the lower bounds on the minimum distance for Goppa codes and for alternant codes,Journal of China Institute of Communications,12(1991)3, 10–16 (in Chinese).
D. Yue, The structure of cyclotomic cosets and its applications,Journal of System Science and Mathematics,12(1992)1, 15–20, (in Chinese).
G. Cohen,IEEE Trans. on IT,IT-26(1980)3, 363.
D. Augot, et al.,IEEE Trans. on IT,IT-38(1992)3, 960–973.
T. Helleseth, Discrete Applied Mathematics, 1985, Vol.11, 157–173.
W. W. Peterson, On the weight structure and symmetry of BCH codes,J. IECE Japan,50(1967)4, 1183–1190.
T. Kasami, N. Tokura,IEEE Trans. on IT,IT-15(1969)5, 408–413.
Author information
Authors and Affiliations
Additional information
Supported by the National Natural Science Foundation of China
About this article
Cite this article
Dianwu, Y., Zhengming, H. On the dimension and minimum distance of BCH codes over GF(q). J. of Electron.(China) 13, 216–221 (1996). https://doi.org/10.1007/BF02685830
Issue Date:
DOI: https://doi.org/10.1007/BF02685830