Springer Nature is making SARS-CoV-2 and COVID-19 research free. View research | View latest news | Sign up for updates

Polynomials generating Hamming codes

  • 75 Accesses

Abstract

A class of polynomials generatingq-nary Hamming codes is studied. The criteria for a polynomial to belong to this class are established for the general case and for the case of prime polynomials. The conditions are determined under which reducible polynomials do not belong to the class of polynomials generating theq-nary Hamming codes.

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

References

  1. 1.

    R. E. Blahut,Theory and Practice of Error Control Codes, Addison-Wesley, Reading, MA (1983).

  2. 2.

    A. G. Kurosh,Lectures on General Algebra [in Russian], Nauka, Moscow (1973).

  3. 3.

    A. Gill,Linear Sequential Circuits, McGraw-Hill, New York.

  4. 4.

    E. R. Berlekamp,Algebraic Coding Theory, McGraw-Hill, New York (1968).

Download references

Author information

Additional information

Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 45, No. 7, pp. 893–897, July, 1993.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Barashko, A.S. Polynomials generating Hamming codes. Ukr Math J 45, 987–992 (1993). https://doi.org/10.1007/BF01057445

Download citation

Keywords

  • Reducible Polynomial
  • Prime Polynomial