Skip to main content
Log in

Combinatorial problems for binary Reed-Muller codes

  • Published:
Cybernetics Aims and scope

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.

Literature Cited

  1. S. D. Berman, “Semisimple cyclic and Abelian codes,” Kibernetika, No. 3 (1967).

  2. W. Peterson, Error Correcting Codes, Wiley, New York (1961).

    Google Scholar 

  3. B. L. Van der Waerden, Modern Algebra, New York (1943).

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

    Google Scholar 

Download references

Authors

Additional information

Translated from Kibernetika, No. 3, pp. 66–71, May–June, 1974.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Nudel'man, D.A. Combinatorial problems for binary Reed-Muller codes. Cybern Syst Anal 10, 450–457 (1974). https://doi.org/10.1007/BF01068713

Download citation

  • Received:

  • Issue Date:

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

Keywords

Navigation