Skip to main content
Log in

Propelinear codes related to some classes of optimal codes

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

Abstract

A code is said to be propelinear if its automorphism group contains a subgroup that acts regularly on codewords. We show propelinearity of complements of cyclic codes C 1,i , (i, 2m − 1) = 1, of length n = 2m − 1, including the primitive two-error-correcting BCH code, to the Hamming code; the Preparata code to the Hamming code; the Goethals code to the Preparata code; and the Z4-linear Preparata code to the Z4-linear perfect code.

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

Access this article

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. Rifà, J., Basart, J.M., and Huguet, L., On Completely Regular Propelinear Codes, Proc. 6th Int. Conf. on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC-6), Rome, Italy, July 4–8, 1988. Mora T., Ed., Lect. Notes Comp. Sci., vol. 357. Berlin: Springer, 1989, pp. 341–355.

    Google Scholar 

  2. Borges, J., Mogilnykh, I.Yu., Rifà, J., and Solov’eva, F.I., Structural Properties of Binary Propelinear Codes, Adv. Math. Commun., 2012, vol. 6, no. 3, pp. 329–346.

    Article  MATH  MathSciNet  Google Scholar 

  3. Mogil’nykh, I.Yu., On Extending Propelinear Structures of the Nordstrom-Robinson Code to the Hamming Code, Probl. Peredachi Inf., 2016, vol. 52, no. 3, pp. 97–107 [Probl. Inf. Trans. (Engl. Transl.), 2016, vol. 52, no. 3, pp. 289–298].

    MATH  MathSciNet  Google Scholar 

  4. Hammons, A.R., Jr., Kumar, P.V., Calderbank, A.R., Sloane, N.J.A., and Solé, P., The Z4-Linearity of Kerdock, Preparata, Goethals, and Related Codes, IEEE Trans. Inform. Theory, 1994, vol. 40, no. 2, pp. 301–319.

    Article  MATH  MathSciNet  Google Scholar 

  5. Preparata, F.P., A Class of Optimum Nonlinear Double-Error-Correcting Codes, Inform. Control, 1968, vol. 13, no. 4, pp. 378–400.

    Article  MATH  MathSciNet  Google Scholar 

  6. Dumer, I.I., Some New Uniformly Packed Codes, in Proc. Moscow Inst. Physics and Technology, Moscow, 1976, pp. 72–78.

    Google Scholar 

  7. Baker, R.D., van Lint, J.H., and Wilson, R.M., On the Preparata and Goethals Codes, IEEE Trans. Inform. Theory, 1983, vol. 29, no. 3, pp. 342–345.

    Article  MATH  MathSciNet  Google Scholar 

  8. Borges, J., Phelps, K.T., Rifà, J., and Zinoviev, V.A., On Z4-linear Preparata-like and Kerdock-like Codes, IEEE Trans. Inform. Theory, 2003, vol. 49, no. 11, pp. 2834–2843.

    Article  MATH  MathSciNet  Google Scholar 

  9. Rifà, J. and Pujol, J., Translation-Invariant Propelinear Codes, IEEE Trans. Inform. Theory, 1997, vol. 43, no. 2, pp. 590–598.

    Article  MATH  MathSciNet  Google Scholar 

  10. Zinoviev, D.V. and Zinoviev, V.A., On the Preparata-like Codes, in Proc. 14th Int. Workshop on Algebraic and Combinatorial Coding Theory (ACCT-14), Svetlogorsk, Russia, Sept. 7–13, 2014, pp. 342–347.

    Google Scholar 

  11. Mogilnykh, I.Yu. and Solov’eva, F.I., Transitive Nonpropelinear Perfect Codes, Discrete Math., 2015, vol. 338, no. 3, pp. 174–182.

    Article  MATH  MathSciNet  Google Scholar 

  12. Kasami, T., Lin, S., and Peterson W.W., Some Results on Cyclic Codes Which Are Invariant under the Affine Group and Their Applications, Inform. Control, 1967, vol. 11, pp. 475–496.

    Article  MATH  MathSciNet  Google Scholar 

  13. Melas, C.M., A Cyclic Code for Double Error Correction, IBM J. Res. Develop., 1960, vol. 4, no. 3, pp. 364–366.

    Article  MATH  Google Scholar 

  14. MacWilliams, F.J. and Sloane, N.J.A., The Theory of Error-Correcting Codes, Amsterdam: North-Holland, 1977. Translated under the title Teoriya kodov, ispravlyayushchikh oshibki, Moscow: Svyaz’, 1979.

    MATH  Google Scholar 

  15. 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. Sympos. on Information Theory, Tsakhkadzor, Armenia, USSR, Sept. 2–8, 1971. Petrov, P.N. and Csaki, F., Eds., Budapest: Akad. Kiadó, 1973, pp. 257–263.

    Google Scholar 

  16. Semakov, N.V. and Zinoviev, V.A., Complete and Quasi-complete Balanced Codes, Probl. Peredachi Inf., 1969, vol. 5, no. 2, pp. 14–18 [Probl. Inf. Trans. (Engl. Transl.), 1969, vol. 5, no. 2, pp. 11–13].

    MATH  MathSciNet  Google Scholar 

  17. Kantor, W.M., On the Inequivalence of Generalized Preparata Codes, IEEE Trans. Inform. Theory, 1983, vol. 29, no. 3, pp. 345–348.

    Article  MATH  MathSciNet  Google Scholar 

  18. Wan, Z.-X., Quaternary Codes, Singapore: World Sci., 1997.

    Book  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to I. Yu. Mogilnykh.

Additional information

The research was carried out at the expense of the Russian Science Foundation, project no. 14-11-00555.

Original Russian Text © I.Yu. Mogilnykh, F.I. Solov’eva, 2017, published in Problemy Peredachi Informatsii, 2017, Vol. 53, No. 3, pp. 54–63.

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. Propelinear codes related to some classes of optimal codes. Probl Inf Transm 53, 251–259 (2017). https://doi.org/10.1134/S0032946017030061

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Navigation