Keywords
Mathematics
Related Publications
Expander codes
Using expander graphs, we construct a new family of asymptotically good, linear error-correcting codes. These codes have linear time sequential decoding algorithms and logarithm...
A note off two binary signaling alphabets
A generalization of Hamming's single error correcting codes is given along with a simple maximum likelihood detection scheme. For small redundancy these alphabets are unexcelled...
A Class of Binary Signaling Alphabets
A class of binary signaling alphabets called “group alphabets” is described. The alphabets are generalizations of Hamming's error correcting codes and possess the following spec...
Wide-area cooperative storage with CFS
The Cooperative File System (CFS) is a new peer-to-peer read-only storage system that provides provable guarantees for the efficiency, robustness, and load-balance of file stora...
Low-density parity-check codes
A low-density parity-check code is a code specified by a parity-check matrix with the following properties: each column contains a small fixed number <tex xmlns:mml="http://www....
Publication Info
- Year
- 1962
- Type
- article
- Volume
- 16
- Issue
- 77
- Pages
- 123-123
- Citations
- 2066
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
2066
OpenAlex
Cite This
R. G. Gallager,
W. W. Peterson
(1962).
Error-Correcting Codes..
Mathematics of Computation
, 16
(77)
, 123-123.
https://doi.org/10.2307/2003832
Identifiers
- DOI
- 10.2307/2003832