Skip to main content
SpringerLink
Log in

Constructions and Invariants of Optimal Codes in the Lee Metric

  • CODING THEORY
  • Published:
Problems of Information Transmission Aims and scope Submit manuscript

Abstract

We propose concatenation and switching methods for the construction of single-error-correcting perfect and diameter codes in the Lee metric. We analyze ranks and kernels of diameter perfect codes obtained by the switching construction.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Golomb, S.W. and Welch, L.R., Perfect Codes in the Lee Metric and the Packing of the Polyominoes, SIAM J. Appl. Math., 1970, vol. 18, no. 2, pp. 302–317. https://doi.org/10.1137/0118025

    Article  MathSciNet  Google Scholar 

  2. AlBdaiwi, B., Horak, P., and Milazzo, L., Enumerating and Decoding Perfect Linear Lee Codes, Des. Codes Cryptogr., 2009, vol. 52, no. 2, pp. 155–162. https://doi.org/10.1007/s10623-009-9273-3

    Article  MathSciNet  Google Scholar 

  3. Etzion, T., Product Constructions for Perfect Lee Codes, IEEE Trans. Inform. Theory, 2011, vol. 57, no. 11, pp. 7473–7481. https://doi.org/10.1109/TIT.2011.2161133

    Article  MathSciNet  Google Scholar 

  4. Solov’eva, F.I., On Binary Nongroup Codes, in Metody diskretnogo analiza v izuchenii bulevykh funktsii i grafov (Methods of Discrete Analysis in Studying Boolean Functions and Graphs), Novosibirsk: Inst. Mat. Sib. Otd. Akad. Nauk SSSR, 1981, vol. 37, pp. 65–76.

    Google Scholar 

  5. Solov’eva, F.I., Partitions into Perfect Codes in the Hamming and Lee Metrics, Probl. Peredachi Inf., 2022, vol. 58, no. 3, pp. 58–69 [Probl. Inf. Transm. (Engl. Transl.), 2022, vol. 58, no. 3, pp. 254–264]. https://doi.org/10.1134/S003294602203005X

    MathSciNet  Google Scholar 

  6. Mogilnykh, I.Yu., On \(q\)-ary Propelinear Perfect Codes Based on Regular Subgroups of the General Affine Group, Probl. Peredachi Inf., 2022, vol. 58, no. 1, pp. 65–79 [Probl. Inf. Transm. (Engl. Transl.), 2022, vol. 58, no. 1, pp. 58–71]. https://doi.org/10.1134/S0032946022010045

    MathSciNet  Google Scholar 

  7. Mogilnykh, I.Yu. and Solov’eva, F.I., On Weight Distributions for a Class of Codes with Parameters of Reed–Muller Codes, Probl. Peredachi Inf., 2022, vol. 58, no. 3, pp. 33–44 [Probl. Inf. Transm. (Engl. Transl.), 2022, vol. 58, no. 3, pp. 231–241]. https://doi.org/10.1134/S0032946022030036

    MathSciNet  Google Scholar 

  8. Mollard, M., Une novelle famille de 3-codes parfaits sur \(\mathrm{GF}(q)\), Discrete Math., 1984, vol. 49, no. 2, pp. 209–212. https://doi.org/10.1016/0012-365X(84)90121-3

    Article  MathSciNet  Google Scholar 

  9. Romanov, A.M., On Non-Full-Rank Perfect Codes over Finite Fields, Des. Codes Cryptogr., 2019, vol. 87, no. 5, pp. 995–1003. https://doi.org/10.1007/s10623-018-0506-1

    Article  MathSciNet  Google Scholar 

  10. Shi, M. and Krotov, D.S., An Enumeration of 1-Perfect Ternary Codes, Discrete Math., 2023, vol. 346, no. 7, Paper No. 113437 (16 pp.). https://doi.org/10.1016/j.disc.2023.113437

    Article  MathSciNet  Google Scholar 

  11. Mogilnykh, I.Yu. and Solov’eva, F.I., A Concatenation Construction for Propelinear Perfect Codes from Regular Subgroups of \(\mathrm{GA}(r,2)\), Sib. Elektron. Mat. Izv., 2019, vol. 16, pp. 1689–1702. https://doi.org/10.33048/semi.2019.16.119

    Article  MathSciNet  Google Scholar 

  12. Zinoviev, V.A. and Zinoviev, D.V., On the Generalized Concatenated Construction for Codes in \(L_1\) and Lee Metrics, Probl. Peredachi Inf., 2021, vol. 57, no. 1, pp. 81–95 [Probl. Inf. Transm. (Engl. Transl.), 2021, vol. 57, no. 1, pp. 70–83]. https://doi.org/10.1134/S003294602101004X

    Google Scholar 

  13. Bos, A., Codes over Groups with Arbitrary Metrics, T.H.-Report of Eindhoven Univ. of Technology, Dept. of Mathematics, Eindhoven, The Netherlands, 1980, no. 80-WSK-06.

  14. Vasil’ev, Yu.L., On Nongroup Densely Packed Codes, Probl. Kibern., 1962, vol. 8, pp. 337–339 [Engl. Transl. in Algebraic Coding Theory: History and Development, Blake, I.F., Ed., Stroudsburg, PA: Dowden, Hutchinson \(\&\) Ross, 1973, pp. 351–357].

    Google Scholar 

  15. Byrne, E. and Weger, V., Bounds in the Lee Metric and Optimal Codes, https://arxiv.org/abs/2112.06635 [cs.IT], 2021.

  16. Delsarte, P., An Algebraic Approach to the Association Schemes of Coding Theory, Philips Res. Rep. Suppl., 1973, no. 10 (97 pp.).

  17. Ahlswede, R., Aydinian, H.K., and Khachatrian, L.H., On Perfect Codes and Related Concepts, Des. Codes Cryptogr., 2001, vol. 22, no. 3, pp. 221–237. https://doi.org/10.1023/A:1008394205999

    Article  MathSciNet  Google Scholar 

  18. Tamo, I. and Schwartz, M., Correcting Limited-Magnitude Errors in the Rank-Modulation Scheme, IEEE Trans. Inform. Theory, 2010, vol. 56, no. 6, pp. 2551–2560. https://doi.org/10.1109/TIT.2010.2046241

    Article  MathSciNet  Google Scholar 

  19. Mogilnykh, I.Yu., \(q\)-ary Propelinear Perfect Codes from the Regular Subgroups of the \(\mathit{GA}(r,q)\) and Their Ranks, https://arxiv.org/abs/2112.08659 [math.CO], 2021.

  20. Romanov, A.M., On Perfect and Reed–Muller Codes over Finite Fields, Probl. Peredachi Inf., 2021, vol. 57, no. 3, pp. 3–16 [Probl. Inf. Transm. (Engl. Transl.), 2021, vol. 57, no. 3, pp. 199–211]. https://doi.org/10.1134/S0032946021030017

    MathSciNet  Google Scholar 

Download references

Funding

The research was carried out at the expense of the Russian Science Foundation, project no. 22-21-00135, https://rscf.ru/en/project/22-21-00135/.

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics of the Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia

    I. Yu. Mogilnykh

Authors
  1. I. Yu. Mogilnykh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. F. I. Solov’eva
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to I. Yu. Mogilnykh.

Ethics declarations

The authors of this work declare that they have no conflicts of interest.

Additional information

Translated from Problemy Peredachi Informatsii, 2023, Vol. 59, No. 2, pp. 3–17. https://doi.org/10.31857/S0555292323020018

Publisher’s Note. Pleiades Publishing remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mogilnykh, I.Y., Solov’eva, F.I. Constructions and Invariants of Optimal Codes in the Lee Metric. Probl Inf Transm 59, 71–85 (2023). https://doi.org/10.1134/S0032946023020011

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0032946023020011

Keywords

Search

Navigation