System Maintenance:
There may be intermittent impact on performance while updates are in progress. We apologize for the inconvenience.
By Topic

Distance spectrum of right-regular low-density parity-check codes: derivation and discussion of numerical results

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Rashidpour, M. ; Dept. of Electr. & Comput. Eng., Univ. of Tehran, Iran ; Jamali, S.H.

The asymptotic distance distribution of regular low-density parity-check (LDPC) codes derived by Litsin and Sherlev (2002) is generalised for the case of irregular LDPC codes with constant check node degree. Numerical analysis of simple irregular LDPC codes with weight-two variable nodes shows that their minimum Hamming distance can be increased linearly with the code length when the maximum variable node degree of the code is kept below a critical value. This result is consistent with the stability condition of the LDPC codes, at least for the simple irregular case.

Published in:

Communications, IEE Proceedings-  (Volume:152 ,  Issue: 2 )