The structure of linear codes of constant weight

Author:
Jay A. Wood

Journal:
Trans. Amer. Math. Soc. **354** (2002), 1007-1026

MSC (2000):
Primary 94B05

Published electronically:
October 26, 2001

MathSciNet review:
1867370

Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: In this paper we determine completely the structure of linear codes over of constant weight. Namely, we determine exactly which modules underlie linear codes of constant weight, and we describe the coordinate functionals involved. The weight functions considered are: Hamming weight, Lee weight, two forms of Euclidean weight, and pre-homogeneous weights. We prove a general uniqueness theorem for virtual linear codes of constant weight. Existence is settled on a case by case basis.

**1.**E. F. Assmus Jr. and H. F. Mattson,*Error-correcting codes: An axiomatic approach*, Information and Control**6**(1963), 315–330. MR**0178997****2.**Kenneth Bogart, Don Goldberg, and Jean Gordon,*An elementary proof of the MacWilliams theorem on equivalence of codes*, Information and Control**37**(1978), no. 1, 19–22. MR**0479646****3.**Arrigo Bonisoli,*Every equidistant linear code is a sequence of dual Hamming codes*, Ars Combin.**18**(1984), 181–186. MR**823843****4.**Alexis Bonnecaze, Patrick Solé, and A. R. Calderbank,*Quaternary quadratic residue codes and unimodular lattices*, IEEE Trans. Inform. Theory**41**(1995), no. 2, 366–377. MR**1326285**, 10.1109/18.370138**5.**Claude Carlet,*One-weight 𝑍₄-linear codes*, Coding theory, cryptography and related areas (Guanajuato, 1998) Springer, Berlin, 2000, pp. 57–72. MR**1749448****6.**I. Constantinescu, W. Heise, and Th. Honold,*Monomial extensions of isometries between codes over*, Proceedings of the Fifth International Workshop on Algebraic and Combinatorial Coding Theory (ACCT '96) (Sozopol, Bulgaria), Unicorn, Shumen, 1996, pp. 98-104.**7.**A. Roger Hammons Jr., P. Vijay Kumar, A. R. Calderbank, N. J. A. Sloane, and Patrick Solé,*The 𝑍₄-linearity of Kerdock, Preparata, Goethals, and related codes*, IEEE Trans. Inform. Theory**40**(1994), no. 2, 301–319. MR**1294046**, 10.1109/18.312154**8.**Jessie MacWilliams,*Error-correcting codes for multiple-level transmission*, Bell System Tech. J.**40**(1961), 281–308. MR**0141541****9.**-,*Combinatorial properties of elementary abelian groups*, Ph.D. thesis, Radcliffe College, Cambridge, Mass., 1962.**10.**Bernard R. McDonald,*Finite rings with identity*, Marcel Dekker, Inc., New York, 1974. Pure and Applied Mathematics, Vol. 28. MR**0354768****11.**Harold N. Ward,*An introduction to divisible codes*, Des. Codes Cryptogr.**17**(1999), no. 1-3, 73–79. MR**1714370**, 10.1023/A:1008302520762**12.**Harold N. Ward and Jay A. Wood,*Characters and the equivalence of codes*, J. Combin. Theory Ser. A**73**(1996), no. 2, 348–352. MR**1370137****13.**Jay A. Wood,*Extension theorems for linear codes over finite rings*, Applied algebra, algebraic algorithms and error-correcting codes (Toulouse, 1997) Lecture Notes in Comput. Sci., vol. 1255, Springer, Berlin, 1997, pp. 329–340. MR**1634126**, 10.1007/3-540-63163-1_26**14.**Jay A. Wood,*Duality for modules over finite rings and applications to coding theory*, Amer. J. Math.**121**(1999), no. 3, 555–575. MR**1738408****15.**-,*Linear codes over of constant Euclidean weight*, Proceedings of the Thirty-Seventh Annual Allerton Conference on Communication, Control, and Computing, University of Illinois, 1999, pp. 895-896.**16.**Jay A. Wood,*Weight functions and the extension theorem for linear codes over finite rings*, Finite fields: theory, applications, and algorithms (Waterloo, ON, 1997), Contemp. Math., vol. 225, Amer. Math. Soc., Providence, RI, 1999, pp. 231–243. MR**1650644**, 10.1090/conm/225/03225**17.**-,*Understanding linear codes of constant weight using virtual linear codes*, Proceedings of the Thirty-Eighth Annual Allerton Conference on Communication, Control, and Computing, University of Illinois, 2000, pp. 1038-1046.**18.**-,*The structure of linear codes of constant weight*, Proceedings of the International Workshop on Coding and Cryptography, Paris, INRIA, 2001, pp. 547-556.

Retrieve articles in *Transactions of the American Mathematical Society*
with MSC (2000):
94B05

Retrieve articles in all journals with MSC (2000): 94B05

Additional Information

**Jay A. Wood**

Affiliation:
Department of Mathematics, Computer Science & Statistics, Purdue University Calumet, Hammond, Indiana 46323, Department of Mathematics, University of Notre Dame, Notre Dame, Indiana 46556, and GRIM, Université Toulon-Var, 83957 La Garde Cedex, France

Address at time of publication:
Department of Mathematics, Western Michigan University, 1903 W. Michigan Ave., Kalamazoo, Michigan 49008–5248

Email:
jay.wood@wmich.edu

DOI:
https://doi.org/10.1090/S0002-9947-01-02905-1

Keywords:
Constant weight codes,
Lee weight,
Euclidean weight,
extension theorem,
orbital codes,
virtual codes

Received by editor(s):
January 15, 2001

Published electronically:
October 26, 2001

Additional Notes:
Partially supported by Purdue University Calumet Scholarly Research Awards. Some results were announced in [17] and [18]. Theorem 10.3 first appeared in [15]

Article copyright:
© Copyright 2001
American Mathematical Society