Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 230,771,348 papers from all fields of science
Search
Sign In
Create Free Account
Reed–Muller code
Known as:
Reed-Muller codes
, Reed-Muller Code
, Muller
Expand
Reed–Muller codes are a family of linear error-correcting codes used in communications. Reed–Muller codes belong to the classes of locally testable…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
22 relations
Algebraic normal form
Bar product
Block code
Coding gain
Expand
Broader (1)
Error detection and correction
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Sparse reconstruction via the Reed-Muller Sieve
R. Calderbank
,
S. Howard
,
Sina Jafarpour
IEEE International Symposium on Information…
2010
Corpus ID: 439197
This paper introduces the Reed Muller Sieve, a deterministic measurement matrix for compressed sensing. The columns of this…
Expand
2010
2010
Reed-Muller Code
Lambert M. Surhone
,
Mariam T. Tennoe
,
Susan F. Henssonow
2010
Corpus ID: 63664647
High Quality Content by WIKIPEDIA articles! Reed-Muller codes are a family of linear error-correcting codes used in…
Expand
2007
2007
Quantum Convolutional Codes Derived From Reed-Solomon and Reed-Muller Codes
S. A. Aly
,
A. Klappenecker
,
P. Sarvepalli
arXiv.org
2007
Corpus ID: 17178916
Convolutional stabilizer codes promise to make quantum communication more reliable with attractive online encoding and decoding…
Expand
2006
2006
Error Exponents for Recursive Decoding of Reed–Muller Codes on a Binary-Symmetric Channel
M. Burnashev
,
I. Dumer
IEEE Transactions on Information Theory
2006
Corpus ID: 15254343
Error exponents are studied for recursive decoding of Reed-Muller (RM) codes and their subcodes used on a binary-symmetric…
Expand
2001
2001
New covering radius of Reed-Muller codes for t-resilient functions
Tetsu Iwata
,
Takayuki Yoshiwara
,
K. Kurosawa
IEEE Transactions on Information Theory
2001
Corpus ID: 1010730
In this paper, we introduce a new covering radius of RM(r,n) from cryptography viewpoint. It is defined as the maximum distance…
Expand
1999
1999
Performance of Reed-Muller codes and a maximum-likelihood decoding algorithm for OFDM
Alan E. Jones
,
T. Wilkinson
IEEE Transactions on Communications
1999
Corpus ID: 27876478
The performance of Reed-Muller encoding and a maximum-likelihood decoding algorithm for orthogonal frequency-division…
Expand
1998
1998
The Reed-Muller Code Is Not -Linear for
Xiang-dong Hou
,
J. Lahtonen
,
Sami Koponen
1998
Corpus ID: 124388728
We show that the Reed-Muller code is not - linear for , proving a conjecture by Hammons, Kumar, Calderbank, Sloane, and Sole.
1987
1987
Reed-Muller expansions of incompletely specified functions
D. Green
1987
Corpus ID: 120952698
The structure of Reed-Muller and generalised Reed-Muller transform matrices is discussed and in particular their description in…
Expand
Highly Cited
1975
Highly Cited
1975
Fault Detecting Test Sets for Reed-Muller Canonic Networks
K. Saluja
,
S. Reddy
IEEE transactions on computers
1975
Corpus ID: 12046690
Fault detecting test sets to detect multiple stuck-at-faults (s-a-faults) in certain networks, realizing Reed-Muller(RM) canonic…
Expand
Highly Cited
1970
Highly Cited
1970
Minimization of Exclusive or and Logical Equivalence Switching Circuits
A. Mukhopadhyay
,
Greg Schmitz
IEEE transactions on computers
1970
Corpus ID: 800032
This paper is an attempt to develop minimization algorithms for switching circuits based on Reed-Muller canonic forms. In…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE