Reed–Muller code

Known as: Reed-Muller codes, Reed-Muller Code, Reed–Muller 
Reed–Muller codes are a family of linear error-correcting codes used in communications. Reed–Muller codes belong to the classes of locally testable… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1962-2017
020406019622017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2008
Highly Cited
2008
Polar coding is a code construction method that can be used to construct capacity-achieving codes for binary-input channels with… (More)
  • table I
  • table II
  • table V
Is this relevant?
Highly Cited
2005
Highly Cited
2005
A code is locally testable if there is a way to indicate with high probability that a vector is far enough from any codeword by… (More)
Is this relevant?
2005
2005
We construct nonbinary quantum codes from classical generalized Reed-Muller codes and derive the conditions under which these… (More)
Is this relevant?
2005
2005
The class of quaternary Reed-Muller codes is introduced as a generalization of Reed-Muller codes to /spl Zopf//sub 4/-linear… (More)
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2001
Highly Cited
2001
Finding explicit extractors is an important derandomization goal that has received a lot of attention in the past decade. This… (More)
  • table 1
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Controlling the peak-to-mean envelope power ratio (PMEPR) of Orthogonal Frequency Division Multiplexed (OFDM) transmissions is a… (More)
  • table I
  • table II
  • table III
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We present a range of coding schemes for OFDM transmission using binary, quaternary, octary, and higher order modulation that… (More)
  • table I
  • table II
  • table III
  • table IV
  • table V
Is this relevant?
1999
1999
A set of quantum error correcting codes based on classical Reed-Muller codes is described. The codes have parameters [[n, k, d… (More)
  • table 1
Is this relevant?
1986
1986
R~sum~. On inlroduit une classe de codes lintaires de la famille des codes de Reed-Muller, les codes de Reed-Muller projectifs… (More)
Is this relevant?
Highly Cited
1971
Highly Cited
1971
Recently, a theorem was proved by Berlekamp (1970) which asserts that all sufficiently low weight codewords in certain supercodes… (More)
Is this relevant?