Published 2001
| public
Book Section - Chapter
BSC Thresholds for Code Ensembles Based on "Typical Pairs" Decoding
Chicago
An error occurred while generating the citation.
Abstract
In this paper, we develop a method for closely estimating noise threshold values for ensembles of binary linear codes on the binary symmetric channel. Our method, based on the "typical pairs" decoding algorithm pioneered by Shannon, completely decouples the channel from the code ensemble. In this, it resembles the classical union bound, but unlike the union bound, our method is powerful enough to prove Shannon's theorem for the ensemble of random linear codes. We apply our method to find numerical thresholds for the ensembles of low-density parity-check codes, and "repeat-accumulate" codes.
Additional Information
© 2001 Springer-Verlag New York, Inc. The work of Aji, Jin, Khandekar, and McEliece on this paper was supported by NSF grant no. CCR-9804793, and grants from Sony, Qualcomm, and Caltech's Lee Center for Advanced Networking. David Mackay's work is supported by the Gatsby Charitable Foundation.Additional details
- Eprint ID
- 101118
- DOI
- 10.1007/978-1-4613-0165-3_11
- Resolver ID
- CaltechAUTHORS:20200204-145114201
- NSF
- CCR-9804793
- Sony Corporation
- Qualcomm Inc.
- Caltech Lee Center for Advanced Networking
- Gatsby Charitable Foundation
- Created
-
2020-02-04Created from EPrint's datestamp field
- Updated
-
2021-11-16Created from EPrint's last_modified field
- Series Name
- IMA Volumes in Mathematics and its Applications
- Series Volume or Issue Number
- 123