Abstract
It is shown that long enough extended t-error correcting BCH codes B t are spanned by its lightest words of weight 2t + 2. The proof follows from an upper bound on the number of words of weight 2t + 2 in any subcode of B t of codimension 1.
Chapter PDF
References
Augot, D., Charpin, P., Sendrier, N.: Studying the locator polynomials of minimum weight codewords of BCH codes. IEEE Trans. Inform. Theory 38(3), 960–973 (1992)
Berlekamp, E.R.: Algebraic Coding Theory. McGraw-Hill, New York (1968)
Cohen, G., Litsyn, S., Zémor, G.: On the traveling salesman problem in binary Hamming spaces. IEEE Trans. Inform. Theory 42(4), 1274–1276 (1996)
Cohen, G., Honkala, I., Litsyn, S., Lobstein, A.: Covering Codes. Elsevier, Amsterdam (1997)
Cohen, S.D.: The length of primitive BCH codes with minimal covering radius. Designs, Codes, and Cryptography 10(1), 5–16 (1997)
Delsarte, P., Goethals, J.M., MacWilliams, F.J.: On generalized Reed-Muller codes and their relatives. Inform. and Control 16, 403–442 (1970)
Desaki, Y., Fujiwara, T., Kasami, T.: The weight distributions of extended binary primitive BCH codes of length 128. IEEE Trans. Inform. Theory 43(4), 1364–1371 (1997)
Ding, P., Key, J.D.: Minimum-weight codewords as generators of generalized Reed-Muller codes. IEEE Trans. Inform. Theory 46(6), 2152–2158 (2000)
Francke, J., Meijers, J.J.H.: Super-visible codes. Discrete Math. 110(1–3), 119–134 (1992)
Gao, S., Key, J.D.: Bases of minimum-weight vectors for codes from designs. Finite Fields Appl. 4(1), 1–15 (1998)
Gutie’rrez, J.N., Tapia-Recillas, H.: A minimum weight basis for the binary Reed-Muller code. Congr. Numer. 154, 195–199 (2002)
Handbook of Coding Theory. North Holland, Amsterdam (1997)
Jutla, C.S., Patthak, A.C., Rudra, A., Zuckerman, D.: Testing low-degree polynomials over prime fields, in book. In: Proc. IEEE Symposium on Foundations of Computer Science (2004)
Kasami, T., Fujiwara, T., Lin, S.: An approximation to the weight distribution of binary linear codes. IEEE Trans. Inform. Theory 31(6), 769–780 (1985)
Kaufman, T., Ron, D.: Testing polynomials over general fields, in book. In: Proc. IEEE Symposium on Foundations of Computer Science (2004)
Keren, O., Litsyn, S.: More on the distance distribution of BCH codes. IEEE Trans. Inform. Theory 45(1), 251–255 (1999)
Koumoto, T., Takata, T., Kasami, T., Lin, S.: A low-weight trellis-based iterative soft-decision decoding algorithm for binary linear block codes. IEEE Trans. Inform. Theory 45(2), 731–741 (1999)
Krasikov, I., Litsyn, S.: On spectra of BCH codes. IEEE Trans. Inform. Theory 41(3), 786–788 (1995)
Krasikov, I., Litsyn, S.: Linear programming bounds for codes of small size. European J. Combin. 18(6), 647–654 (1997)
Krasikov, I., Litsyn, S.: On the distance distributions of BCH codes and their duals. Des. Codes Cryptogr. 23(2), 223–231 (2001)
Krasikov, I., Litsyn, S.: Survey of binary Krawtchouk polynomials. In: Codes and Association Schemes. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 56, pp. 199–211 (2001)
Levy-dit-Vehel, F., Litsyn, S.: More on the covering radius of BCH codes. IEEE Trans. Inform. Theory 42, 1023–1028 (1996)
MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error Correcting Codes. North Holland, Amsterdam (1977)
Marshall, A.W., Olkin, I.: Inequalities: Theory of Majorization and its Applications. Academic Press, New York (1979)
McEliece, R.J., Rumsey Jr., H.: Sphere-packing in the Hamming metric. Bull. Amer. Math. Soc. 75, 32–34 (1969)
Sidel’nikov, V.M.: The spectrum of weights of binary Bose-Chaudhuri-Hocquenghem codes. Problemy Peredachi Informatsii 7(1), 14–22 (1971)
Skorobogatov, A.N., Vladuts, S.G.: The covering radius of long binary BCH codes. Problemy Peredachi Informatsii 25(1), 38–45 (1989)
Solé, P.: A limit law on the distance distribution of binary codes. IEEE Trans. Inform. Theory 36, 229–232 (1990)
Tietäväinen, A.: Bounds for binary codes just outside the Plotkin range. Inform. and Control 47(2), 85–93 (1980)
Tietäväinen, A.: On the covering radius of long binary BCH codes. Discr. App. Math. 16, 75–77 (1987)
Tietäväinen, A.: An asymptotic bound on the covering radius of binary BCH codes. IEEE Trans. Inform. Theory 36, 211–213 (1990)
Vladuts, S., Skorobogatov, A.: On spectra of subcodes over subfields of algebraic-geometric codes. Probl. Peredachi Inform. 27(1), 24–36 (1991)
van Zanten, A.J.: Minimal-change order and separability in linear codes. IEEE Trans. Inform. Theory 39(6), 1988–1989 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kaufman, T., Litsyn, S. (2006). Long Extended BCH Codes Are Spanned by Minimum Weight Words. In: Fossorier, M.P.C., Imai, H., Lin, S., Poli, A. (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC 2006. Lecture Notes in Computer Science, vol 3857. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11617983_28
Download citation
DOI: https://doi.org/10.1007/11617983_28
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-31423-3
Online ISBN: 978-3-540-31424-0
eBook Packages: Computer ScienceComputer Science (R0)