publication . Preprint . Conference object . 2008

Analysis of Non-binary Hybrid LDPC Codes

Lucile Sassatelli; David Declercq;
Open Access English
  • Published: 15 Jan 2008
Abstract
Comment: in the proceedings of IEEE International Symposium on Information Theory, June 2007, Nice, France
Subjects
arXiv: Computer Science::Information TheoryComputer Science::Hardware Architecture
free text keywords: Computer Science - Information Theory, Concatenated error correction code, Turbo code, Linear code, Forward error correction, Discrete mathematics, BCJR algorithm, Serial concatenated convolutional codes, Low-density parity-check code, Block code, Combinatorics, Computer science

[1] M. Davey and D.J.C. MacKay, “Low Density Parity Check Codes over GF(q),” IEEE Commun. Lett., vol. 2, pp. 165-167, June 1998.

[2] D. Sridhara and T.E. Fuja, “Low Density parity Check Codes over Groups and Rings,” in the proc. of ITW'02, Bangladore, India, Oct. 2002.

[3] X.-Y. Hu and E. Eleftheriou, “Binary Representation of Cycle TannerGraph GF(2q ) Codes,” in the proc. of ICC'04, pp. 528-532, Paris, France, June 2004. [OpenAIRE]

[4] A. Bennatan and David Burshtein, ”Design and Analysis of Nonbinary LDPC Codes for Arbitrary Discrete-Memoryless Channels,” IEEE Trans. on Inform. Theory, vol. 52, no. 2, pp. 549-583, Feb. 2006.

[5] A. Goupil, M. Colas, G. Gelle and D. Declercq, “FFT-based BP Decoding of General LDPC Codes over Abelian Groups,” to appear in the IEEE Trans. on Commun., 2006.

[6] T. Richardson, A. Shokrollahi and R. Urbanke, ”Design of CapacityApproaching Irregular LDPC Codes,” IEEE Trans. on Inform. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.

[7] L. Sassatelli and D. Declercq, ”Non-binary Hybrid LDPC Codes: Structure, Decoding and Optimization,” in IEEE Inform. Theory Workshop, Chengdu, China, October 2006, http://arxiv.org/PS cache/cs/pdf/0701/0701066v1.pdf.

[8] C. Poulliat, M. Fossorier and D. Declercq, “Using Binary Image of Nonbinary LDPC Codes to Improve Overall Performance,” in IEEE Intern. Symp. on Turbo Codes, Munich, April 2006.

Powered by OpenAIRE Research Graph
Any information missing or wrong?Report an Issue