TY - GEN
T1 - A method for constructing LDPC codes with low error floor
AU - Sharon, Eran
AU - Litsyn, Simon
PY - 2006
Y1 - 2006
N2 - This paper describes a novel Progressive Edge Growth (PEG) algorithm for constructing LDPC codes with minimized block error probability over the Binary Erasure Channel (BEC). The constructed codes provide superior performance and lower error floor compared to codes generated by previously known algorithms. Furthermore, an upper bound on the expected block error probability in the error floor region of the generated code is derived.
AB - This paper describes a novel Progressive Edge Growth (PEG) algorithm for constructing LDPC codes with minimized block error probability over the Binary Erasure Channel (BEC). The constructed codes provide superior performance and lower error floor compared to codes generated by previously known algorithms. Furthermore, an upper bound on the expected block error probability in the error floor region of the generated code is derived.
UR - http://www.scopus.com/inward/record.url?scp=39049088678&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2006.262096
DO - 10.1109/ISIT.2006.262096
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:39049088678
SN - 1424405041
SN - 9781424405046
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 2569
EP - 2573
BT - Proceedings - 2006 IEEE International Symposium on Information Theory, ISIT 2006
T2 - 2006 IEEE International Symposium on Information Theory, ISIT 2006
Y2 - 9 July 2006 through 14 July 2006
ER -