Optimal regular LDPC codes for the binary erasure channel

We prove that for any given R between 0 and 1 the best threshold value for a regular LDPC code of rate R with common variable degree v and common check degree c occurs when v is at least 3 and is minimal subject to the condition $R=1-v/c$


Published in:
IEEE Communication Letters, 9, 6, 546-548
Year:
2005
Keywords:
Laboratories:




 Record created 2007-01-16, last modified 2018-07-07


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)