Skip to main content
SpringerLink
Log in

On the embedding of constant-weight codes into perfect codes

  • Published:
Journal of Applied and Industrial Mathematics Aims and scope Submit manuscript

Abstract

We show that each q-ary constant-weight code of weight 3, minimum distance 4, and length m embeds in a q-ary 1-perfect code of length n = (q m − 1)/(q − 1).

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

Similar content being viewed by others

References

  1. Yu. L. Vasil’ev, “On Nongroup Close-Packed Codes,” in Problems of Cybernetics, Vol. 8, Ed, by A. A. Lyapunov (Fizmatgiz, Moscow, 1962), pp. 375–378.

    Google Scholar 

  2. A. M. Romanov, “A Survey of Methods for Constructing Nonlinear Perfect Binary Codes,” Diskretn. Anal. Issled. Oper. Ser. 1, 13 (4), 60–88 (2006) [J. Appl. Indust. Math. 2 (2), 252–269 (2008)].

    MATH  Google Scholar 

  3. A.M. Romanov, “On Admissible Families of Components of Hamming Codes,” Diskretn.Anal. Issled.Oper. 19 (2), 84–91 (2012) [J. Appl. Indust. Math. 6 (3), 355–359 (2012)].

    MathSciNet  MATH  Google Scholar 

  4. S. V. Avgustinovich and D. S. Krotov, “Embedding in a Perfect Code,” J. Combin. Des. 17 (5), 419–423 (2009).

    Article  MathSciNet  MATH  Google Scholar 

  5. T. Etzion and A. Vardy, “Perfect Binary Codes: Constructions, Properties, and Enumeration,” IEEE Trans. Inform. Theory 40 (3), 754–763 (1994).

    Article  MathSciNet  MATH  Google Scholar 

  6. T. Etzion, “Nonequivalent q-Ary Perfect Codes,” SIAMJ. DiscreteMath. 9 (3), 413–423 (1996).

    MathSciNet  MATH  Google Scholar 

  7. D. S. Krotov and E. V. Sotnikova, “Embedding in q-Ary 1-Perfect Codes and Partitions,” Discrete Math. 338 (11), 1856–1859 (2015).

    Article  MathSciNet  MATH  Google Scholar 

  8. B. Lindström, “On Group and Nongroup Perfect Codes in q Symbols,” Math. Scand. 25, 149–158 (1969).

    Article  MathSciNet  MATH  Google Scholar 

  9. K. T. Phelps and M. Villanueva, “Ranks of q-Ary 1-Perfect Codes,” Des. Codes Cryptogr. 27 (1–2), 139–144 (2002).

    Article  MathSciNet  MATH  Google Scholar 

  10. J. Schönheim, “On Linear and Nonlinear Single-Error-Correcting q-Ary Perfect Codes,” Inform. Control 12, 23–26 (1968).

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, pr. Akad. Koptyuga 4, Novosibirsk, 630090, Russia

    A. M. Romanov

Authors
  1. A. M. Romanov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. M. Romanov.

Additional information

Original Russian Text © A.M. Romanov, 2016, published in Diskretnyi Analiz i Issledovanie Operatsii, 2016, Vol. 23, No. 3, pp. 26–34.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Romanov, A.M. On the embedding of constant-weight codes into perfect codes. J. Appl. Ind. Math. 10, 556–559 (2016). https://doi.org/10.1134/S1990478916040128

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation