Skip to main content
SpringerLink
Log in

Polynomials generating Hamming codes

  • Published:
Ukrainian Mathematical Journal Aims and scope

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 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. R. E. Blahut,Theory and Practice of Error Control Codes, Addison-Wesley, Reading, MA (1983).

    Google Scholar 

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

    Google Scholar 

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

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Applied Mathematics and Mechanics, Ukrainian Academy of Sciences, Donetsk

    A. S. Barashko

Authors
  1. A. S. Barashko
    View author publications

    You can also search for this author in PubMed Google Scholar

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

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01057445

Keywords

Search

Navigation