research article
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$
Type
research article
Author(s)
Date Issued
2005
Published in
Volume
9
Issue
6
Start page
546
End page
548
Subjects
Editorial or Peer reviewed
REVIEWED
Written at
EPFL
EPFL units
Available on Infoscience
January 16, 2007
Use this identifier to reference this record