Name
Abstract | ||
|---|---|---|
We introduce and analyze verification-based decoding for low-density parity-check (LDPC) codes, an approach specifically designed to manipulate data in packet-sized units. Verification-based decoding requires only linear time for both encoding and decoding and succeeds with high probability under random errors. We describe how to utilize code scrambling to extend our results to channels with errors controlled by an oblivious adversary. |
Year | DOI | Venue |
|---|---|---|
2005 | 10.1109/TIT.2004.839499 | IEEE Transactions on Information Theory |
Keywords | Field | DocType |
probability,indexing terms,ldpc code,low density parity check,decoding,linear time | Discrete mathematics,Berlekamp–Welch algorithm,Sequential decoding,Scrambling,Low-density parity-check code,Computer science,Network packet,Algorithm,Decoding methods,List decoding,Encoding (memory) | Journal |
Volume | Issue | ISSN |
51 | 1 | 0018-9448 |
Citations | PageRank | References |
32 | 1.56 | 18 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Michael Luby | 1 | 9010 | 1319.35 |
| Michael Mitzenmacher | 2 | 7386 | 730.89 |