Application of Boolean algebra to switching circuit design and to error detection

By D. E. Muller. 1954

How researchers see this paper

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

Private Stateful Information Retrieval (2018, methodology): “Using leveled fully homomorphic encryption [13] and Reed-Muller codes [42, 46], Hamlin et al.”
Channel coding: The road to channel capacity (2006, methodology): “Another early class of error-correcting codes was the Reed-Muller (RM) codes, which were introduced in 1954 by David Muller [13], and then reintroduced shortly thereaft r with an efficient decoding algorithm by Irving Reed [14].”
A performance comparison of polar codes and Reed-Muller codes (2008, methodology): “Specifically, 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.”
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 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 polar coding had much in common with Reed-Muller (RM) coding [ 3 ], [4].”