List-message passing achieves capacity on the q-ary symmetric channel for large q

GLOBECOM - IEEE Global Telecommunications Conference

Volumn , Issue , 2007, Pages 283-287

  Fan, Zhang ^a   Pfister, Henry D ^a  

^a Department of Electrical and Computer Engineering

Author keywords

[No Author keywords available]

Indexed keywords

SYMBOL PROBABILITIES; SYMMETRIC CHANNEL;

CHANNEL CAPACITY; COMPUTATION THEORY; PROBABILITY; VERIFICATION;

MESSAGE PASSING;

EID: 39349102234     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GLOCOM.2007.60     Document Type: Conference Paper

References (15)

1. R. G. Gallager, "Low-density parity-check codes," IRE Trans. Inform. Theory, vol. 18, pp. 21-28, Jan. 1962.
2. D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inform. Theory, vol. 45, pp. 399-431, Mar. 1999.
3. M. Luby, M. Mitzenmacher, M. Shokrollahi, and D. Spielman, "Efficient erasure correcting codes," IEEE Trans. Inform. Theory, vol. 47, pp. 569-584, Feb. 2001.
4. M. A. Shokrollahi, "New sequences of linear time erasure codes approaching the channel capacity," in Applicable Algebra in Eng., Commun. Comp., pp. 65-76, 1999.
5. J. Metzner, "Multiuser diversity for a dirty paper approach," IEEE Trans. Commun., vol. 44, pp. 1227-1230, Oct. 1996.
6. M. Davey and D. MacKay, "Low density parity check codes over GF(q)," IEEE Commun. Lett., vol. 2, pp. 58-60, 1998.
7. M. Luby and M. Mitzenmacher, "Verification-based decoding for packet-based low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 51, pp. 120-127, Jan. 2005.
8. A. Shokrollahi, "Capacity-approaching codes on the q-ary symmetric channel for large q," in Proc. IEEE Inform. Theory Workshop, (San Antonio, TX), pp. 204-208, Oct. 2004.
9. D. Bleichenbacher, A. Kiyayias, and M. Yung, "Decoding of interleaved Reed-Solomon codes over noisy data," in Proc. of ICALP, pp. 97-108, 2003.
10. 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, (Chicago, IL), p. 275, June 2004.
11. 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." Unpublished extended abstract, 2004.
12. T. Richardson and R. Urbanke, "The capacity of low-density parity-check codes under message-passing decoding," IEEE Trans. Inform. Theory, vol. 47, pp. 599-618, Feb. 2001.
13. T. Richardson, M. Shokrollahi, and R. Urbanke, "Design of capacity-approaching irregular low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, pp. 619-637, Feb. 2001.
14. R. Storn and K. Price, "Differential evolution-A simple and efficient heuristic for global optimization over continuous spaces," J. Global Optim., vol. 11, no. 4, pp. 341-359, 1997.
15. S. Sarvotham, D. Baron, and R. Baraniuk, "Sudocodes-Fast measurement and reconstruction of sparse signals," in Proc. IEEE Int. Symp. Information Theory, (Seattle, WA), pp. 2804-2808, July 2006.