Skip Nav Destination
Close Modal
Update search
NARROW
Format
Subjects
Date
Availability
1-12 of 12
Robert G. Gallager
Close
Follow your search
Access your saved searches in your account
Would you like to receive an alert when new items match your search?
Sort by
Publisher: The MIT Press
Published: 15 September 1963
DOI: 10.7551/mitpress/4347.003.0001
EISBN: 9780262256216
Publisher: The MIT Press
Published: 15 September 1963
DOI: 10.7551/mitpress/4347.003.0002
EISBN: 9780262256216
Publisher: The MIT Press
Published: 15 September 1963
DOI: 10.7551/mitpress/4347.003.0003
EISBN: 9780262256216
Publisher: The MIT Press
Published: 15 September 1963
DOI: 10.7551/mitpress/4347.003.0004
EISBN: 9780262256216
Publisher: The MIT Press
Published: 15 September 1963
DOI: 10.7551/mitpress/4347.003.0005
EISBN: 9780262256216
Publisher: The MIT Press
Published: 15 September 1963
DOI: 10.7551/mitpress/4347.003.0006
EISBN: 9780262256216
Publisher: The MIT Press
Published: 15 September 1963
DOI: 10.7551/mitpress/4347.003.0007
EISBN: 9780262256216
Publisher: The MIT Press
Published: 15 September 1963
DOI: 10.7551/mitpress/4347.003.0008
EISBN: 9780262256216
Publisher: The MIT Press
Published: 15 September 1963
DOI: 10.7551/mitpress/4347.003.0009
EISBN: 9780262256216
Publisher: The MIT Press
Published: 15 September 1963
DOI: 10.7551/mitpress/4347.003.0010
EISBN: 9780262256216
Publisher: The MIT Press
Published: 15 September 1963
DOI: 10.7551/mitpress/4347.003.0011
EISBN: 9780262256216
Publisher: The MIT Press
Published: 15 September 1963
DOI: 10.7551/mitpress/4347.001.0001
EISBN: 9780262256216
This is a complete presentation of all important theoretical and experimental work done on low-density codes. Low-density coding is one of the three techniques thus far developed for efficient communication over noisy channels with an arbitrarily low probability of error. A principal result of information theory is that if properly coded information is transmitted over a noisy channel at a rate below channel capacity, the probability of error can be made to approach zero exponentially with the code length. Any practical use of this theorem, however, requires a coding scheme in which the cost of storage and computation equipment grows slowly with code length. The present book analyzes a class of coding schemes for which costs grow approximately linearly with code length. It demonstrates that error probability approaches zero exponentially with a root of the block length and cites experimental evidence that this coding scheme has profitable aplicability in many communications situations.