LOGIN TO YOUR ACCOUNT

Username
Password
Remember Me
Or use your Academic/Social account:

CREATE AN ACCOUNT

Or use your Academic/Social account:

Congratulations!

You have just completed your registration at OpenAire.

Before you can login to the site, you will need to activate your account. An e-mail will be sent to you with the proper instructions.

Important!

Please note that this site is currently undergoing Beta testing.
Any new content you create is not guaranteed to be present to the final version of the site upon release.

Thank you for your patience,
OpenAire Dev Team.

Close This Message

CREATE AN ACCOUNT

Name:
Username:
Password:
Verify Password:
E-mail:
Verify E-mail:
*All Fields Are Required.
Please Verify You Are Human:
fbtwitterlinkedinvimeoflicker grey 14rssslideshare1
Sassatelli, Lucile; Declercq, David (2008)
Languages: English
Types: Preprint
Subjects: Computer Science - Information Theory

Classified by OpenAIRE into

arxiv: Computer Science::Information Theory, Computer Science::Hardware Architecture
In this paper, we analyse asymptotically a new class of LDPC codes called Non-binary Hybrid LDPC codes, which has been recently introduced. We use density evolution techniques to derive a stability condition for hybrid LDPC codes, and prove their threshold behavior. We study this stability condition to conclude on asymptotic advantages of hybrid LDPC codes compared to their non-hybrid counterparts.
  • The results below are discovered through our pilot algorithms. Let us know how we are doing!

    • [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.
    • [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.
  • No related research data.
  • No similar publications.

Share - Bookmark

Cite this article

Collected from