Skip to main content
SpringerLink
Log in

On Components of Preparata Codes

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

Abstract

The paper considers the interrelation between i-components of an arbitrary Preparata-like code P and i-components of a perfect code C containing P. It is shown that each i-component of P can uniquely be completed to an i-component of C by adding a certain number of special codewords of C. It is shown that the set of vertices of P in a characteristic graph of an arbitrary i-component of C forms a perfect code with distance 3.

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. Semakov, N.V., Zinoviev, V.A., and Zaitsev, G.V., Uniformly Packed Codes, Probl. Peredachi Inf., 1971, vol. 7, no. 1, pp. 38–50[Probl. Inf. Trans. (Engl. Transl.), 1971, vol. 7, no. 1, pp. 30–39].

    Google Scholar 

  2. Avgustinovich, S.V. and Solov'eva, F.I., New Constructions and Properties of Perfect Codes, Trudy konferentsii po diskretnomu analizu i issledovaniyu operatsii (Proc. Conf. on Discrete Analysis and Operations Research), Novosibirsk, 2000, pp. 5–10.

  3. Vasil'ev, Yu.L., On Nongroup Closely Packed Codes, Probl. Kibern., 1962, vol. 8, pp. 337–339.

    Google Scholar 

  4. Etzion, T. and Vardy, A., Perfect Binary Codes: Constructions, Properties, and Enumeration, IEEE Trans. Inf. Theory, 1994, vol. 40, no. 3, pp. 754–763.

    Google Scholar 

  5. Semakov, N.V., Zinoviev, V.A., and Zaitsev, G.V., Interrelation of Preparata and Hamming Codes and Extension of Hamming Codes to New Double-Error-Correcting Codes, Proc. 2nd Int. Symp. on Information Theory, Tsahkadsor, Armenia, USSR, 1971, Petrov, P.N. and Csaki, F., Eds., Budapest: Akad. Kiado, 1973, pp. 257–263.

    Google Scholar 

  6. Avgustinovich, S.V. and Solov'eva, F.I., Construction of Perfect Binary Codes by the Sequential Translations of the i-Components, in Proc. 5th Int. Workshop on Algebr. Comb. Coding Theory, Sozopol, Bulgary, 1996, pp. 9–13.

  7. Solov'eva, F.I., 5On Factorization of Code-Generating DNFs, Metody diskretnogo analiza v issledovaniifunktsional'nykh sistem (Methods of Discrete Analysis in Studying Functional Systems), Novosibirsk: Inst. Mat. Sib. Otd. Akad. Nauk SSSR, 1988, vol. 47, pp. 66–88.

    Google Scholar 

  8. Solov'eva, F.I., Sharp Bounds for the Connectivity of Code-Generating DNFs, Preprint of Inst. Mat. Sib. Otd. Akad. Nauk SSSR, Novosibirsk, 1990, no. 10.

  9. Borges, J., Phelps, K.T., Rifa, J., and Zinoviev, V.A., On ℤ4-Linear Preparata-Like and Kerdock-Like Codes, IEEE Trans. Inf. Theory, 2003, vol. 49, no. 11, pp. 2834–2843.

    Google Scholar 

  10. Solov'eva, F.I., Structure of i-Components of Perfect Binary Codes, Discr. Appl. Math., 2001, vol. 111, pp. 189–197.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Novosibirsk State University, Russia

    N. N. Tokareva

Authors
  1. N. N. Tokareva
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Tokareva, N.N. On Components of Preparata Codes. Problems of Information Transmission 40, 159–164 (2004). https://doi.org/10.1023/B:PRIT.0000043933.08204.89

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:PRIT.0000043933.08204.89

Keywords

Search

Navigation