Remote Access Transactions of the American Mathematical Society
Green Open Access

Transactions of the American Mathematical Society

ISSN 1088-6850(online) ISSN 0002-9947(print)

 
 

 

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
DOI: https://doi.org/10.1090/S0002-9947-01-02905-1
Published electronically: October 26, 2001
MathSciNet review: 1867370
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: In this paper we determine completely the structure of linear codes over $\mathbb Z/N\mathbb Z$ 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.


References [Enhancements On Off] (What's this?)

  • 1. E. F. Assmus, Jr. and H. F. Mattson, Error-correcting codes: An axiomatic approach, Inform. and Control 6 (1963), 315-330. MR 31:3251
  • 2. K. Bogart, D. Goldberg, and J. Gordon, An elementary proof of the MacWilliams theorem on equivalence of codes, Inform. and Control 37 (1978), 19-22. MR 57:19067
  • 3. A. Bonisoli, Every equidistant linear code is a sequence of dual Hamming codes, Ars Combin. 18 (1984), 181-186. MR 87b:94044
  • 4. A. Bonnecaze, P. Solé, and A. R. Calderbank, Quaternary quadratic residue codes and unimodular lattices, IEEE Trans. Inform. Theory 41 (1995), 366-377. MR 96b:94027
  • 5. C. Carlet, One-weight \(\ensuremath{\mathbb{Z} } _4\)-linear codes, Coding Theory, Cryptography and Related Areas (J. Buchmann, T. Høholdt, H. Stichtenoth, and H. Tapia-Recillas, eds.), Springer, Berlin, 2000, pp. 57-72. MR 2000m:94034
  • 6. I. Constantinescu, W. Heise, and Th. Honold, Monomial extensions of isometries between codes over $\ensuremath{\mathbb{Z} } _m$, Proceedings of the Fifth International Workshop on Algebraic and Combinatorial Coding Theory (ACCT '96) (Sozopol, Bulgaria), Unicorn, Shumen, 1996, pp. 98-104.
  • 7. A. R. Hammons, Jr., P. V. Kumar, A. R. Calderbank, N. J. A. Sloane, and P. Solé, The $\mathbb{Z} _4$-linearity of Kerdock, Preparata, Goethals, and related codes, IEEE Trans. Inform. Theory 40 (1994), 301-319. MR 95k:94030
  • 8. F. J. MacWilliams, Error-correcting codes for multiple-level transmission, Bell System Tech. J. 40 (1961), 281-308. MR 25:4945
  • 9. -, Combinatorial properties of elementary abelian groups, Ph.D. thesis, Radcliffe College, Cambridge, Mass., 1962.
  • 10. B. R. McDonald, Finite rings with identity, Pure and Applied Mathematics, vol. 28, Marcel Dekker, Inc., New York, 1974. MR 50:7245
  • 11. H. N. Ward, An introduction to divisible codes, Des. Codes Cryptogr. 17 (1999), 73-79. MR 2000j:94039
  • 12. H. N. Ward and J. A. Wood, Characters and the equivalence of codes, J. Combin. Theory Ser. A 73 (1996), 348-352. MR 96i:94028
  • 13. J. A. Wood, Extension theorems for linear codes over finite rings, Applied Algebra, Algorithms and Error-Correcting Codes (T. Mora and H. Mattson, eds.), Lecture Notes in Comput. Sci., vol. 1255, Springer-Verlag, Berlin, 1997, pp. 329-340. MR 99h:94062
  • 14. -, Duality for modules over finite rings and applications to coding theory, Amer. J. Math. 121 (1999), 555-575. MR 2001d:94033
  • 15. -, Linear codes over $\mathbb{Z} /(2^k)$ 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. -, Weight functions and the extension theorem for linear codes over finite rings, Finite fields: Theory, Applications and Algorithms (R. C. Mullin and G. L. Mullen, eds.), Contemp. Math., vol. 225, Amer. Math. Soc., Providence, 1999, pp. 231-243. MR 2000b:94024
  • 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.

Similar Articles

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

American Mathematical Society