Skip to main content
SpringerLink
Log in

On the regularity of perfect 2-colorings of the Johnson graph

  • Coding Theory
  • Published:
Problems of Information Transmission Aims and scope Submit manuscript

Abstract

We study perfect colorings of the Johnson graph in two colors. We give sufficient conditions for a perfect coloring of the Johnson graph to be k-regular and present examples of perfect colorings. The proof of the theorem is in many respects similar to the proof of the result by Etzion and Schwartz [1] on k-regularity of perfect codes.

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.

Similar content being viewed by others

References

  1. Etzion, T. and Schwartz, M., Perfect Constant-Weight Codes, IEEE Trans. Inform. Theory, 2004, vol. 50, no. 9, pp. 2156–2165.

    Article  MathSciNet  Google Scholar 

  2. Fon-der-Flaass, D.G., Perfect Colorings of a Hypercube, in Proc. 985th AMS Meeting, Indiana Univ., Bloomington, USA, 2003, p. 31–32.

  3. Zinoviev, V.A. and Rifà, J., On New Completely Regular q-ary Codes, Probl. Peredachi Inf., 2007, vol. 43, no. 2, pp. 34–51 [Probl. Inf. Trans. (Engl. Transl.), 2007, vol. 43, no. 2, pp. 97–112].

    Google Scholar 

  4. Martin, W.J., Completely Regular Designs, J. Combin. Des., 1998, vol. 6, no. 4, pp. 261–273.

    Article  MATH  MathSciNet  Google Scholar 

  5. Delsarte, P., An Algebraic Approach to the Association Schemes of Coding Theory, Philips Res. Rep. Suppl., 1973, no. 10.

  6. 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.

    Article  MATH  MathSciNet  Google Scholar 

  7. Gordon, D.M., Perfect Single Error-Correcting Codes in the Johnson Scheme, IEEE Trans. Inform. Theory, 2006, vol. 52, no. 10, pp. 4670–4672.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Sobolev Institute of Mathematics, Siberian Branch of the RAS, Novosibirsk State University, Novosibirsk, Russia

    I. Yu. Mogil’nykh

Authors
  1. I. Yu. Mogil’nykh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to I. Yu. Mogil’nykh.

Additional information

Original Russian Text © I. Yu. Mogil’nykh, 2007, published in Problemy Peredachi Informatsii, 2007, Vol. 43, No. 4, pp. 37–44.

Supported in part by the MathTree (Tree Catalog of Mathematical Resources in the Internet) project no. 35, Siberian Branch of the RAS.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Mogil’nykh, I.Y. On the regularity of perfect 2-colorings of the Johnson graph. Probl Inf Transm 43, 303–309 (2007). https://doi.org/10.1134/S0032946007040035

Download citation

  • Received:

  • Accepted:

  • Issue Date:

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

Keywords

Search

Navigation