Dispersed Reed-Solomon codes for iterative decoding and construction of q-ary LDPC codes

GLOBECOM - IEEE Global Telecommunications Conference

Volumn 3, Issue , 2005, Pages 1193-1198

  Zeng, Lingqi ^a   Lan, ^a   Tai, Ying Y ^a   Lin, Shu ^a  

^a University of California Davis   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC METHODS; DISPERSED REED-SOLOMON CODES; ITERATIVE DECODING; SPECIAL VECTOR REPRESENTATIONS;

DECODING; ITERATIVE METHODS; VECTORS;

CODES (SYMBOLS);

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

References (17)

1. R. G. Gallager, "Low density parity check codes," IRE Trans. Inform. Theory, IT-8, pp. 21-28, Jan. 1962.
2. D. J. C. MacKay and R. M. Neal, "Near Shannon limit performance of low density parity check codes," Electro. Lett., vol. 32, pp. 1645-1646, Aug. 1996.
3. D. J. C. MacKay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inform. Theory, vol. 45, pp. 399-432, Mar. 1999.
4. J. Pearl, Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, Mrogan Kaufmann, San Mateo, CA., 1988.
5. 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.
6. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacity-approaching low density parity check codes," IEEE Trans. Inform. Theory, vol. 47, pp. 619-637, Feb., 2001.
7. R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inform. Theory, vol. 27, pp. 533-547, Sept. 1981.
8. F. R. Kschinschang, B. J. Frey, and H. -A. Loeliger, "Factor graphs and the sum-product algorithm," IEEE Trans. Inform. Theory, vol. 47, pp. 498-519. Feb. 2001.
9. K. Yu, S. Lin, and M. Fossorier, "Low density parity check codes based on finite geometries: a discovery and new results," IEEE Trans. Inform. Theory, vol. 47, pp. 2711-2736, Nov. 2001.
10. Z. -W. Li, L. Chen, L. -Q. Zeng, S. Lin, and W. Fong, "Efficient encoding of quasi-cyclic low-density parity-check codes," IEEE Trans. Commun., to appear.
11. M. Davey and D. J. C. MacKay, "Low density parity check codes over GF(q)," IEEE Commun. Lett., vol. 2, no. 6, pp. 165-167, June 1998.
12. E. R. BerleKamp, Algebraic Coding Theory, McGraw-Hill, New Yor, 1968.
13. S. Lin and D. J. Costello, Jr., Error Control Coding: Fundamentals and Applications, 2nd edition, Prentice Hall, 2004.
14. H. Song and J. R. Cruz, "Reduced-complexity decoding of q-ary LDPC codes for magnetic recording," IEEE Trans. Magn., vol.39, no. 3, pp. 1081-1087, Mar. 2003.
15. H. Wymeersch, H. Steendam and M. Moeneclaey, "Log-domain decoding of LDPC codes over GF(q)," Proc. IEEE Int. Conf. on Commun., pp. 772-776, Paris France, June 2004.
16. D. Declercq, M. Fossorier, "Decoding algorithms for nonbinary LDPC codes over GF(q)," submitted to IEEE Trans. Commun., 2005.
17. H. Tang, J. Xu, S. Lin, and K. Abdel-Ghaffar, "Codes on Finite Geometries," IEEE Trans. Inform. Theory, vol. 51, no. 2, pp 572-596, Feb. 2005.