Skip to main content

Reed–Muller Codes

  • Reference work entry
  • 225 Accesses

Synonyms

Boolean functions

Related Concepts

Boolean Functions; Extended Cyclic Code; Information Theory; Symmetric Cryptography

Definition

The Reed–Muller code of length 2m and order r is the linear binary code whose codewords can be identified to Boolean functions of m variables and of algebraic degree less than or equal to r.

Background

Coding theory

Theory

It is well known that any property of Reed–Muller codes is a property of Boolean functions. Reed–Muller codes provide a natural way to quantify the degree, the nonlinearity, the correlation-immunity, or the propagation criterion of a Boolean function [1]. On the other hand, Reed–Muller codes are an important class of error-correcting codes, in particular they can be viewed as extended cyclic codes. They play a crucial role in the study of important families of cryptographic mappings, such as permutations on finite fields. Here, the multivariable definition of Reed–Muller codes is presented. More on Reed–Muller codes can be found...

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   799.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD   949.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Recommended Reading

  1. Massey JL (1995) Some applications of coding theory in cryptography. In: Farell PG (ed) Codes and ciphers: cryptography and coding IV. Formara, Essex, pp 33–47

    Google Scholar 

  2. Pless VS, Huffman WC, Brualdi RA (1998) An introduction to algebraic codes. Handbook of coding theory, part 1: algebraic coding, chapter 1. Elsevier, Amsterdam

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this entry

Cite this entry

Charpin, P. (2011). Reed–Muller Codes. In: van Tilborg, H.C.A., Jajodia, S. (eds) Encyclopedia of Cryptography and Security. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-5906-5_366

Download citation

Publish with us

Policies and ethics