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.
Buy single article
Instant access to the full article PDF.
Price includes VAT for USA
Subscribe to journal
Immediate online access to all issues from 2019. Subscription will auto renew annually.
This is the net price. Taxes to be calculated in checkout.
R. E. Blahut,Theory and Practice of Error Control Codes, Addison-Wesley, Reading, MA (1983).
A. G. Kurosh,Lectures on General Algebra [in Russian], Nauka, Moscow (1973).
A. Gill,Linear Sequential Circuits, McGraw-Hill, New York.
E. R. Berlekamp,Algebraic Coding Theory, McGraw-Hill, New York (1968).
Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 45, No. 7, pp. 893–897, July, 1993.
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
- Reducible Polynomial
- Prime Polynomial