Abstract
The paper deals with perfect 1-error correcting codes over a finite field with q elements (briefly q-ary 1-perfect codes). We show that the orthogonal code to a q-ary non-full-rank 1-perfect code of length \(n = (q^{m}-1)/(q-1)\) is a q-ary constant-weight code with Hamming weight equal to \(q^{m - 1}\), where m is any natural number not less than two. Necessary and sufficient conditions for q-ary codes to be q-ary non-full-rank 1-perfect codes are obtained. We suggest a generalization of the concatenation construction to the q-ary case and construct a ternary 1-perfect code of length 13 and rank 12.
Similar content being viewed by others
References
Alderson T.L.: (6, 3)-MDS codes over an alphabet of size 4. Des. Codes Crypt. 38(1), 31–40 (2006).
Delsarte P.: Bounds for unrestricted codes, by linear programming. Philips Res. Rep. 27, 272–289 (1972).
Etzion T., Vardy A.: Perfect binary codes: constructions, properties, and enumeration. IEEE Trans. Inf. Theory 40(3), 754–763 (1994).
Etzion T., Vardy A.: On perfect codes and tilings: problems and solutions. SIAM J. Discrete Math. 11(2), 205–223 (1998).
Heden O.: A new construction of group and nongroup perfect codes. Inform. Control 34, 314–323 (1977).
Heden O.: On perfect p-ary codes of length p + 1. Des. Codes Cryptogr. 46(1), 45–56 (2008).
Heden O., Krotov D.S.: On the structure of non-full-rank perfect \(q\)-ary codes. Adv. Math. Commun. 5(2), 149–156 (2011).
Krotov D.S., Sotnikova E.V.: Embedding in \(q\)-ary 1-perfect codes and partitions. Discrete Math. 338(11), 1856–1859 (2015).
Lindström B.: On group and nongroup perfect codes in \(q\) symbols. Math. Scand. 25, 149–158 (1969).
MacWilliams F.J., Sloane N.J.A.: The Theory of Error-Correcting Codes. North-Holland Publishing Co., Amsterdam (1977).
Mollard M.: A generalized parity function and its use in the construction of perfect codes. SIAM J. Algebr. Discrete Methods 7(1), 113–115 (1986).
Östergård P.R.J., Pottonen O., Phelps K.T.: The perfect binary one-error-correcting codes of length 15: part II-properties. IEEE Trans. Inform. Theory 56(6), 2571–2582 (2010).
Phelps K.T.: A combinatorial construction of perfect codes. SIAM J. Algebr. Discrete Methods 4, 398–403 (1983).
Phelps K.T.: A general product construction for error correcting codes. SIAM J. Algebr. Discrete Methods 5(2), 224–228 (1984).
Phelps K.T.: A product construction for perfect codes over arbitrary alphabets. IEEE Trans. Inf. Theory 30(5), 769–771 (1984).
Phelps K.T.: An enumeration of 1-perfect binary codes. Aust. J. Comb. 21, 287–298 (2000).
Phelps K.T., LeVan M.J.: Switching equivalence classes of perfect codes. Des. Codes Cryptogr. 16(2), 179–184 (1999).
Phelps K.T., Rifà J., Villanueva M.: Kernels and \(p\)-kernels of \(p^r\)-ary 1-perfect codes. Des. Codes Cryptogr. 37(2), 243–261 (2005).
Phelps K.T., Villanueva M.: Ranks of \(q\)-ary 1-perfect codes. Des. Codes Cryptogr. 27(1–2), 139–144 (2002).
Romanov A.M.: Hamiltonicity of minimum distance graphs of 1-perfect codes. Electron. J. Comb. 19(1), P65 (2012).
Romanov A.M.: On full-rank perfect codes over finite fields. J. Appl. Indus. Math. 10(3), 444–452 (2016).
Romanov A.M.: On non-full-rank perfect codes over finite fields. In: Proceedings of International Conference “Mathematics in the Modern World”, Novosibirsk, 14–19 August 2017, p. 473 (2017).
Schönheim J.: On linear and nonlinear single-error-correcting \(q\)-nary perfect codes. Inform. Control 12, 23–26 (1968).
Solov’eva F.I.: On binary nongroup codes. Methody Diskr. Anal. 37, 65–76 (1981).
Vasil’ev J.L.: On nongroup close-packed codes. Probl. Cybernet. 8, 375–378 (1962).
Zinoviev V.A.: Generalized concatenated codes. Probl. Inform. Transm. 12(1), 5–15 (1976).
Zinoviev V.A., Zinoviev D.V.: Binary perfect and extended perfect codes of lengths \(15\) and \(16\) with ranks \(13\) and \(14\). Probl. Inform. Transm. 46(1), 20–24 (2010).
Acknowledgements
The author would like to thank the anonymous referees for their helpful comments and suggestions. The results of this paper were presented at the International Conference “Mathematics in the Modern World” [22].
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by V. A. Zinoviev.
Rights and permissions
About this article
Cite this article
Romanov, A.M. On non-full-rank perfect codes over finite fields. Des. Codes Cryptogr. 87, 995–1003 (2019). https://doi.org/10.1007/s10623-018-0506-1
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10623-018-0506-1