Gallager, Robert G.,
Low-density parity-check codes. - 1 PDF (ix, 102 pages) : illustrations. - M.I.T. Press research monographs ; 21st . - M.I.T. Press research monographs ; no. 21. .
Revision of thesis, Massachusetts Institute of Technology.
Includes bibliographical references (p. 100-101).
Restricted to subscribers or individual electronic text purchasers.
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.
Mode of access: World Wide Web
9780262256216
Telecommunication.
Information theory.
Electronic books.
TK5101 / .G25 1963eb
621.38
Low-density parity-check codes. - 1 PDF (ix, 102 pages) : illustrations. - M.I.T. Press research monographs ; 21st . - M.I.T. Press research monographs ; no. 21. .
Revision of thesis, Massachusetts Institute of Technology.
Includes bibliographical references (p. 100-101).
Restricted to subscribers or individual electronic text purchasers.
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.
Mode of access: World Wide Web
9780262256216
Telecommunication.
Information theory.
Electronic books.
TK5101 / .G25 1963eb
621.38