Low-Density Parity-Check Codes
Low-Density Parity-Check Codes
Proud to be B-Corp
Our business meets the highest standards of verified social and environmental performance, public transparency and legal accountability to balance profit and purpose. In short, we care about people and the planet.
The feel-good place to buy books
- Free delivery in the UK
- Supporting authors with AuthorSHARE
- 100% recyclable packaging
- B Corp - kinder to people and planet
- Buy-back with World of Books - Sell Your Books

Low-Density Parity-Check Codes by Robert G Gallager
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.
| SKU | Non disponible |
| ISBN 13 | 9780262571777 |
| ISBN 10 | 0262571773 |
| Titre | Low-Density Parity-Check Codes |
| Auteur | Robert G Gallager |
| Série | The Mit Press |
| État | Non disponible |
| Type de reliure | Paperback |
| Éditeur | MIT Press Ltd |
| Année de publication | 2003-03-17 |
| Nombre de pages | 116 |
| Note de couverture | La photo du livre est présentée à titre d'illustration uniquement. La reliure, la couverture ou l'édition réelle peuvent varier. |
| Note | Non disponible |