Abstract
This paper investigates the structures and properties of one-Lee weight codes and two-Lee weight projective codes over ℤ4. The authors first give the Pless identities on the Lee weight of linear codes over ℤ4. Then the authors study the necessary conditions for linear codes to have one-Lee weight and two-Lee projective weight respectively, the construction methods of one-Lee weight and two-Lee weight projective codes over ℤ4 are also given. Finally, the authors recall the weight-preserving Gray map from (ℤ n4 , Lee weight) to (\(\mathbb{F}_2^{2n} \), Hamming weight), and produce a family of binary optimal oneweight linear codes and a family of optimal binary two-weight projective linear codes, which reach the Plotkin bound and the Griesmer bound.
Similar content being viewed by others
References
Bonisoli A, Every equidistant linear code is a sequence of dual Hamming codes, Ars Combin., 1983, 18: 181–186.
Lint J V and Tolhuizenon L, On perfect ternary constant weight codes, Designs Codes and Cryptography, 1999, 18(1–3): 231–234.
Vega G, Determining the number of one-weight cyclic codes when length and dimension are given, WAIFI, 2007, LNCS 4547, 284–293.
MacWilliams F J and Sloane N J A, The Theory of Error-Correcting Codes, Amsterdam, Nethland, 1977.
Carlet C, One-weight ℤ4-linear codes, Coding Theory, Cryptography and Related Areas, Springer, 2000, 57–72.
Wood J A, The structure of linear codes of constant weight, Trans. Amer. Math. Soc., 2001, 354: 1007–1026.
Wang Y, Zhu S X, Kai X S, and Lin D, One-Lee weight codes and two-Lee weight projective codes over \(\mathbb{F}_2 + u\mathbb{F}_2 \), Journal of Shanghai Jiaotong University, 2012, 46(6): 842–847.
Shi M J, Zhu S X, and Yang S L, A class of optimal p-ary codes from one-weight codes over \(\mathbb{F}_p [u]/\left\langle {u^m } \right\rangle \), Journal of The Franklin Institute, 2013, 350(5): 929–937.
Byrne E, Greferath M, and Honold T, Ring geometries, two-weight codes, and strongly regular graphs, Designs Codes and Cryptography, 2008, 48(1): 1–16.
Vega G, Two-weight cyclic codes constructed as the direct sum of two one-weight cyclic codes, Fnite Fields and Their Applications, 2008, 14(3): 785–797.
Vega G and Wolfmann J, New class of 2-weight cyclic codes, Designs Codes and Cryptography, 2007, 42(3): 327–334.
Wolfmann J, Projective two-weight irreducible cyclic and constacyclic codes, Fnite Fields and Their Applications, 2008, 14(2): 351–360.
Wolfmann J, Are 2-weight projective cyclic codes irreducible? IEEE Trans. Inform. Theory, 2005, 51(2): 733–737.
Bouyukliev I, Fack V, Willems W, and Winne J, Projective two-weight codes with small parameters and their corresponding graphs, Designs Codes and Cryptography, 2006, 41(1): 59–78.
Brouwer A E and Eupen M V, The correspondence between projective codes and 2-weight codes, Designs Codes and Cryptography, 1997, 11(3): 261–266.
Calderbank A R and Cantor W M, The geometry of two-weight codes, Bull. London Math. Soc., 1986, 18(2): 97–122.
Wan Z X, Quaternary Codes, Singapore, World Scientific, 1997.
Hammons A, Kumar P V, Calderbank A R, Sloane N J A, and Solé P, The ℤ4-linearity of Kerdock, Preparata, Goethals, and Related codes, IEEE Trans. Inform. Theory, 1994, 40(2): 301–319.
Ling S and Xing C, Coding Theory — A First Course, Cambridge University Press, Cambridge, 2004.
Author information
Authors and Affiliations
Corresponding author
Additional information
The first author of this paper is supported by the National Natural Science Foundation of China under Grant Nos. 61202068 and 11126174, Talents youth Fund of Anhui Province Universities under Grant No. 2012SQRL020ZD; The second author of this paper is supported by Key Discipline Construction of Hefei University 2014XK08.
This paper was recommended for publication by Editor HU Lei.
Rights and permissions
About this article
Cite this article
Shi, M., Wang, Y. Optimal binary codes from one-lee weight codes and two-lee weight projective codes over ℤ4 . J Syst Sci Complex 27, 795–810 (2014). https://doi.org/10.1007/s11424-014-2188-8
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11424-014-2188-8