A class of multiple-error-correcting codes and the decoding scheme

By I. Reed. 1954

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Private Stateful Information Retrieval (2018, methodology): “Using leveled fully homomorphic encryption [13] and Reed-Muller codes [42, 46], Hamlin et al.”
Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels (2008, background): “As the present work progressed, it became clear that the main aspects of polarization coding bear close resemblances to Reed-Muller (RM) coding [2], [3].”
Low-density parity-check codes based on finite geometries: A rediscovery and new results (2001, methodology): “This concatenated system performs better than a concatenated system in which a Reed-Solomon (RS) code, say the NASA standard (255,223) RS code over GF(¾ ), is used as the outer code and decoded algebraically or decoded based on a reliability based decoding algorithm.”
Information flow on trees (2001, methodology): “The following construction exploits properties of Reed Solomon codes [25], see also [26].”
Algebraic Codes for Data Transmission: Dedication (2002, background): “Shortly thereafter Muller (1954) described a class of multiple-error-correcting codes and Reed (1954) gave a decoding algorithm for them.”
Channel coding: The road to channel capacity (2006, methodology): “Reed [14] introduced a low-complexity hard-decision error -c rection algorithm for RM codes based on a simple majority-logic decoding rule .”
A performance comparison of polar codes and Reed-Muller codes (2008, methodology): “Speciﬁcally, we demonstrate how to use the polar coding idea to improve the performance of Reed Muller (RM) codes [2], [3] without increasing their encoding and decoding complexity.”
Polar Codes for Channel and Source Coding (2009, methodology): “Other important algebraic codes are Golay codes, BCH codes [9, 10], Reed-Muller codes [11, 12] and Reed-Solomon codes [13].”