Analysis of Low Density Codes and Improved Designs Using Irregular Graphs (1998)
Cached
Download Links
- [www.icsi.berkeley.edu]
- [www.research.digital.com]
- [ftp.icsi.berkeley.edu]
- [www.eecs.harvard.edu]
- [www.cs.yale.edu]
- DBLP
Other Repositories/Bibliography
| Citations: | 64 - 12 self |
BibTeX
@MISC{Luby98analysisof,
author = {Michael G. Luby and Michael Mitzenmacher and M. Amin Shokrollahi and Daniel A. Spielman},
title = {Analysis of Low Density Codes and Improved Designs Using Irregular Graphs},
year = {1998}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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 incl...
