Verification-based decoding for packet-based low-density parity-check codes

IEEE Transactions on Information Theory

Volumn 51, Issue 1, 2005, Pages 120-127

  Luby, Michael G ^a   Mitzenmacher, Michael ^b  

^a Digital Fountain Inc   (United States)

^b HARVARD UNIVERSITY   (United States)

Author keywords

Low density parity check (LDPC) codes; Packet based codes; Q ary symmetric channel; Verification based decoding

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); DECODING; ENCODING (SYMBOLS); ERROR ANALYSIS; ERROR CORRECTION; ERROR DETECTION; POLYNOMIALS; PROBABILITY; THEOREM PROVING;

CODE SCRAMBLING; LOW DENSITY PARITY CHECK (LDPC) CODES; PACKET BASED CODES; SYMMETRIC CHANNEL; VERIFICATION BASED DECODING;

INFORMATION THEORY;

EID: 12444329864     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2004.839499     Document Type: Article

References (22)

1. S. Chung, G. D. Forney, T. Richardson, and R. Urbanke, "On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit," IEEE Commun. Lett., vol. 5, no. 2, pp. 58-60, Feb. 2001.
2. M. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. Spielman, " Improved low-density parity-check codes using irregular graphs," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 585-598, Feb. 2001.
3. D. J. C. MacKay, "Good error correcting codes based on very sparse matrices," IEEE Trans. Inf. Theory, vol. 45, no. 2, pp. 399-431, Mar. 1999.
4. D. J. C. MacKay and R. M. Neal, "Near Shannon limit performance of low density parity check codes," Electron. Lett., vol. 32, pp. 1645-1646, 1996.
5. T. Richardson, M. A. Shokrollahi, and R. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
6. T. Richardson and R. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 599-618, Feb. 2001.
7. M. Luby, M. Mitzenmacher, M. A. Shokrollahi, and D. Spielman, "Efficient erasure correcting codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 569-584, Feb. 2001.
8. J. W. Byers, J. Considine, M. Mitzenmacher, and S. Rost, "Informed content delivery across adaptive overlay networks," in Proc. ACM SIG-COMM '02, vol. 32, 2002, pp. 47-60.
9. J. W. Byers, M. Luby, and M. Mitzenmacher, "Accessing multiple mirror sites in parallel: Using Tornado codes to speed up downloads," in Proc. IEEE INFOCOM '99, Mar. 1999, pp. 275-283.
10. J. W. Byers, M. Luby, M. Mitzenmacher, and A. Rege, "A digital fountain approach to reliable distribution of bulk data," IEEE J. Sel. Areas Commun., vol. 20, no. 8, pp. 1528-1540, Oct. 2002.
11. G. D. Forney, Jr., Concatenated Codes. Cambridge, MA: MIT Press, 1966.
12. P. Gopalan, R. Lipton, and Y. Z. Ding, "Codes, adversaries, and information: A computational approach," paper, 2001, submitted for publication.
13. R. G. Gallager, Low-Density Parity-Check Codes. Cambridge, MA: MIT Press, 1963.
14. J. M. Chung and J. J. Metzner, "Theoretical analysis of the error correction performance of majority-logic-like vector symbol codes," IEEE Trans. Commun., vol. 49, no. 6, pp. 979-987, Jun. 2001.
15. J. J. Metzner, "Majority-logic-like decoding of vector symbols," IEEE Trans. Commun., vol. 44, no. 10, pp. 1227-1230, Oct. 1996.
16. M. C. Davey and D. J. C. MacKay, "Low density parity check codes over GF(q)," IEEE Commun. Let., vol. 2, no. 6, pp. 165-167, Jun. 1998.
17. G. D. Forney, Jr., "Burst-correcting codes for the classic bursty channel," IEEE Trans. Commun. Technol., vol. COM-19, no. 5, pp. 772-781, Oct. 1971.
18. T. Richardson and R. Urbanke, "Efficient encoding of low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 638-656, Feb. 2001.
19. M. Luby, M. Mitzenmacher, and M. A. Shokrollahi, "Analysis of random processes via and-or tree evaluation," in Proc. 9th Annu. ACM-SIAM Symp. Discrete Algorithms, 1998, pp. 364-373.
20. M. A. Shokrollahi, "New sequences of linear time erasure codes approaching the channel capacity," in Proc. 13th Int. Symp. Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1999, vol. 1719, pp. 65-76.
21. P. Oswald and M. A. Shokrollahi, "Capacity-achieving sequences for the erasure channel," IEEE Trans. Inf. Theory, vol. 48, no. 12, pp. 3017-3028, Dec. 2002.
22. M. Mitzenmacher, "Verification codes for deletions," in Proc. 2003 IEEE Int. Symp. Information Theory, Yokohama, Japan, p. 217.