Polynomial time low-density parity-check codes with rates very close to the capacity of the q-ary random deletion channel for large q

IEEE Transactions on Information Theory

Volumn 52, Issue 12, 2006, Pages 5496-5501

  Mitzenmacher, Michael ^a,b  

^a IEEE   (United States)

^b HARVARD UNIVERSITY   (United States)

Author keywords

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

Indexed keywords

DELETION CHANNEL; LOW-DENSITY PARITY-CHECK CODES (LDPC; Q-ARY SYMMETRIC CHANNEL; VERIFICATION-BASED DECODING;

CHANNEL CAPACITY; CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; DECODING; PROBABILISTIC LOGICS; RANDOM PROCESSES;

POLYNOMIALS;

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

References (18)

1. 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.
2. M. C. Davey and D. J. C. MacKay, "Reliable communication over channels with insertions, deletions, and substitutions," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 671-686, Feb. 2001.
3. S. Diggavi and M. Grossglauer, "On transmission over deletion channels," in Proc. 39th Annu. Allerton Conference on Communication, Control and Computing, Monticello, IL, 2001, pp. 573-582.
4. E. Drinea and M. Mitzenmacher, "On lower bounds for the capacity of deletion channels," IEEE Trans. Inf. Theory, vol. 52, no. 10, pp. 4648-4657, Oct. 2006.
5. _, "Improved lower bounds for i.i.d. deletion and insertion channels," in Proc. 42nd Annu. Allerton Conf. Communication, Control and Computing, Monticello, IL, 2004, submitted for publication.
6. M. Luby and M. Mitzenmacher, "Verification-based decoding for packet-based low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 120-127, Jan. 2005.
7. 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, San Francisco, CA, Jan. 1998, pp. 364-373.
8. 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.
9. 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.
10. J. J. Matzner, "Majority-Logic-like decoding of vector symbols," IEEE Trans. Commun., vol. 44, no. 10, pp. 1227-1230, Oct. 1996.
11. J. J. Metzner, "Majority-logic-like vector symbol decoding with alternative symbols," IEEE Trans. Commun., vol. 48, no. 12, pp. 2005-2013, Dec. 2000.
12. M. Mitzenmacher, "Verification codes for deletion channels," in Proc. 2003 IEEE Int. Symp. Information Theory, Yokohama, Japan, 2003, p. 217.
13. T. Richardson and T. 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.
14. _, "Efficient encoding of low-density parity-check codes," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 638-656, Feb. 2001.
15. L. Schulman and D. Zuckerman, "Asymptotically good codes correcting insertions, deletions, and transpositions," IEEE Trans. Inf. Theory, vol. 45, no. 7, pp. 2552-2557, Nov. 1999.
16. 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), M. Fossorier, H. Imai, S. Lin, and A. Poli, Eds. Berlin, Germany: Springer-Verlag, 1999, vol. 1719, pp. 65-76.
17. A. Shokrollahi and W. Wang, "Low-density parity-check codes with rates very close to the capacity of the q-ary symmetric channel for large q," in Proc. IEEE Int. Symp. Information Theory, Chicaso, IL, Jun./Jul. 2004, p. 275.
18. N. J. A. Sloane, "On single-deletion-correcting codes," in Codes and Designs (Ray-Chaudhuri Festschrift), K. T. Arasu and A. Seress, Eds. Berlin, Germany: de Guyter, 2002, pp. 273-291.