Abstract
We study the generalized and extended weight enumerator of the q-ary Simplex code and the q-ary first order Reed-Muller code. For our calculations we use that these codes correspond to a projective system containing all the points in a finite projective or affine space. As a result from the geometric method we use for the weight enumeration, we also completely determine the set of supports of subcodes and words in an extension code.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Assmus E.F. Jr.: On the Reed-Muller codes. Discrete Math. 106/107, 25–33 (1992)
Assmus E.F. Jr., Key J.D.: Designs and their codes. Cambridge University Press, Cambridge (1992)
Calderbank R., Kantor W.M.: The geometry of two-weight codes. Bull. Lond. Math. Soc. 18, 97–122 (1986)
Heijnen P., Pellikaan G.R.: Generalized Hamming weights of q-ary Reed-Muller codes. IEEE Trans. Inform. Theory 44, 181–196 (1998)
Helleseth T., Kløve T., Mykkeltveit J.: The weight distribution of irreducible cyclic codes with block lengths n 1((q l−1)/n). Discrete Math. 18, 179–211 (1977)
Jurrius R.P.M.J., Pellikaan G.R.: Algebraic geometric modeling in information theory. In: Codes, arrangements and matroids. Series on Coding Theory and Cryptology. World Scientific Publishing, Hackensack, NJ (2011) http://www.worldscibooks.com/series/sctc_series.shtml.
Katsman G.L., Tsfasman M.A.: Spectra of algebraic-geometric codes. Probl. Inform. Transm. 23, 19–34 (1987)
Kløve T.: The weight distribution of linear codes over GF(q l) having generator matrix over GF(q). Discrete Math. 23, 159–168 (1978)
Kløve T.: Support weight distribution of linear codes. Discrete Math. 106/107, 311–316 (1992)
Mphako E.G.: Tutte polynomials of perfect matroid designs. Combin. Probab. Comput. 9, 363–367 (2000)
Simonis J.: The effective length of subcodes. AAECC 5, 371–377 (1993)
Tonchev V.D.: Linear perfect codes and a characterization of the classical designs. Des. Codes Cryptogr. 17, 121–128 (1999)
Tsfasman M.A., Vlǎdut S.G.: Algebraic-geometric codes. Kluwer Academic Publishers, Dordrecht (1991)
Tsfasman M.A., Vlǎdut S.G.: Geometric approach to higher weights. IEEE Trans. Inform. Theory 41, 1564–1588 (1995)
Wei V.K.: Generalized Hamming weights for linear codes. IEEE Trans. Inform. Theory 37, 1412–1418 (1991)
Acknowledgments
The author would like to thank Vladimir Tonchev for coming up with the question about the weight enumerator of the extension codes of the Simplex code, and for his encouraging conversations on the subject.
Open Access
This article is distributed under the terms of the Creative Commons Attribution Noncommercial License which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by J. D. Key.
Rights and permissions
Open Access This is an open access article distributed under the terms of the Creative Commons Attribution Noncommercial License (https://creativecommons.org/licenses/by-nc/2.0), which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
About this article
Cite this article
Jurrius, R.P.M.J. Weight enumeration of codes from finite spaces. Des. Codes Cryptogr. 63, 321–330 (2012). https://doi.org/10.1007/s10623-011-9557-2
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-011-9557-2