Download:
|
by Michael G. Luby, Michael Mitzenmacher, M. Amin Shokrollahi, Daniel A. Spielman
http://www.icsi.berkeley.edu/~luby/PAPERS/anaerr.ps
Add To MetaCart
Abstract:
In [6], Gallager introduces a family of codes based on sparse bipartite graphs, which he calls low-density paritycheck codes. He suggests a natural decoding algorithm for these codes, and proves a good bound on the fraction of errors that can be corrected. As the codes that Gallager builds are derived from regular graphs, we refer to them as regular codes. Following the general approach introduced in [7] for the design and analysis of erasure codes, we consider error-correcting codes based on random irregular bipartite graphs, which we call irregular codes. We introduce tools based on linear programming for designing linear time irregular codes with better error-correcting capabilities than possible with regular codes. For example, the decoding algorithm for the rate 1/2 regular codes of Gallager can provably correct up to 5.17% errors asymptotically, whereas we have found irregular codes for which our decoding algorithm can provably correct up to 6.27 % errors asymptotically. We include the results of simulations demonstrating the effectiveness of our codes on systems of reasonable size.
Citations
|
4387
|
Probabilistic Reasoning in Intelligent Systems
– Pearl
- 1988
|
|
1258
|
Randomized Algorithms
– Motwani, Raghavan
- 1997
|
|
788
|
Near Shannon limit error-correcting coding and decoding: turbo codes
– Berrou, Glavieux, et al.
- 1993
|
|
482
|
The Viterbi algorithm
– Forney, D
- 1973
|
|
356
|
Low-Density Parity-Check Codes
– Gallager
- 1963
|
|
252
|
Good error-correcting codes based on very sparse matrices
– MacKay
- 1999
|
|
167
|
Expander codes
– Sipser, Spielman
- 1996
|
|
157
|
Practical loss-resilient codes
– Luby, Mitzenmacher, et al.
- 1997
|
|
156
|
Near Shannon limit performance of low density parity check codes,” Electron
– MacKay, Neal
- 1996
|
|
138
|
Codes and decoding on general graphs
– Wiberg
- 1996
|
|
64
|
Analysis of random processes via and-or tree evaluation
– Luby, Mitzenmacher, et al.
- 1998
|
|
47
|
Multiple turbo codes
– Divsalar, Pollara
- 1995
|
|
16
|
Probability propagation and iterative decoding
– Frey, Kschischang
- 1996
|
|
9
|
Some High-Rate Near Capacity Codecs for the Gaussian Channel
– Cheng, McEliece
- 1996
|
|
8
|
Improved low density parity check codes using irregular graphs and belief propagation
– Luby, Mitzenmacher, et al.
- 1998
|
|
7
|
Turbo Coding as an Instance of Pearl's 'Belief Propagation' Algorithm
– MacKay, R, et al.
- 1999
|
|
6
|
Linear Time Encodable and Decodable Error-Correcting Codes
– Spielman
- 1996
|
