Group-theoretic analysis of cayley-graph-based cycle gf(2p) codes

IEEE Transactions on Communications

Volumn 57, Issue 6, 2009, Pages 1560-1565

  Huang, Jie ^a   Zhou, Shengli ^a   Zhu, Jinkang ^b   Willett, Peter ^a  

^a UNIVERSITY OF CONNECTICUT   (United States)

^b UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

Author keywords

Cayley graph; Cycle code; Galois field; Group theory; LDPC

Indexed keywords

CAYLEY GRAPH; CYCLE CODE; GALOIS FIELD; GROUP THEORY; LDPC;

ALGEBRA; DECODING; MATRIX ALGEBRA;

GRAPH THEORY;

EID: 67650699225     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2009.06.070066     Document Type: Article

References (19)

1. R. G. Gallager, Low Density Parity Check Codes. Cambridge, MA: MIT Press, 1963.
2. D. J. C. Mackay, "Good error-correcting codes based on very sparse matrices," IEEE Trans. Inform. Theory, vol. 45, no. 2, pp. 399-431, Mar. 1999.
3. M. C. Davey and D. Mackay, "Low-density parity-check codes over GF(q)," IEEE Commun. Lett., vol. 2, pp. 165-167, June 1999.
4. D. Jungnickel and S. A. Vanstone, "Graphical codes revisited," IEEE Trans. Inform. Theory, vol. 43, pp. 136-146, Jan. 1997.
5. X.-Y. Hu and E. Eleftheriou, "Binary representation of cycle Tannergraph GF(2b) codes," in Proc. IEEE International Conf. Commun. June 2004, vol. 27, no. 1, pp. 528-532.
6. M. C. Davey, "Error-correction using low-Density parity-check codes," dissertation, University of Cambridge, 1999.
7. H. Song and J. R. Cruz, "Reduced-complexity decoding of Q-ary LDPC codes for magnetic recording," IEEE Trans. Magn., vol. 39, pp. 1081-1087, Mar. 2003.
8. L. Barnault and D. Declercq, "Fast decoding algorithm for LDPC codes over GF(2q)," in Proc. IEEE Inform. Theory Workshop, 2003, pp. 70-73.
9. A. Voicila, D. Declercq, F. Verdier, M. Fossorier, and P. Urard, "Low-complexity, low-memory EMS algorithm for non-binary LDPC codes," in Proc. IEEE International Conf. Commun., June 2007, pp. 671-676.
10. J. Huang and J.-K. Zhu, "Linear time encoding of cycle GF(2p) codes through graph analysis," IEEE Commun. Lett., vol. 10, pp. 369-371, May 2006.
11. J. Rosenthal and P. O. Vontobel, "Constructions of LDPC codes using Ramanujan Graphs and ideals from Margulis," in Proc. 38th Annual Allerton Conf. Commun., Control, Computing, 2000, pp. 248-257.
12. M. Sipser and D. A. Spielman, "Expander codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1710-1722, Nov. 1996.
13. G. Davidoff, P. Sarnak, and A. Valette, Elementary Number Theory, Group Theory, and Ramanujan Graphs. Cambridge, UK: Cambridge University Press, 2002.
14. J.-M. Xu, Theory and Application of Graphs. Kluwer Academic Publishers, July 2003.
15. D. J. C. Mackay, "Optimizing sparse graph codes over GF(q)," [Online]. Available: http://www.inference.phy.cam.ac.uk/mackay/CodesGallager.html
16. X.-Y. Hu, E. Eleftheriou, and D.-M. Arnold, "Regular and irregular progressive edge-growth Tanner graphs," IEEE Trans. Inform. Theory vol. 51, pp. 386-398, Jan. 2005.
17. T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of provably good low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, pp. 619-637, Feb. 2001.
18. B. Zhou, Y.-Y. Tai, L. Lan, S. Song, L. Zeng, and S. Lin, "Construction of high performance and efficiently encodable nonbinary quasi-cyclic LDPC codes," in Proc. Global Telecommun. Conf., Nov.-Dec. 2006.
19. D. J. C. Mackay, "Online database of low-density parity-check codes," [Online]. Available: http://www.inference.phy.cam.ac.uk/mackay/codes/data.html