DocumentCode :
2724815
Title :
Asymptotic distribution of absorbing sets and fully absorbing sets for regular sparse code ensembles
Author :
Lin, Chi-Wei ; Dolecek, Lara
Author_Institution :
Electr. Eng. Dept., Univ. of California, Los Angeles, CA, USA
fYear :
2011
fDate :
Jan. 31 2011-Feb. 3 2011
Firstpage :
31
Lastpage :
36
Abstract :
Past work focused on the asymptotic enumeration of trapping sets under random ensembles for specific codes. In this paper, we extend the asymptotic analysis of trapping sets to find the distribution of elementary absorbing sets and elementary fully absorbing sets, which are a special class of trapping sets. The asymptotic results for elementary (fully) absorbing sets are presented, and compared with the results of trapping sets. The distribution of fully absorbing sets allows one to determine the error rates for bit-flipping decoders more accurately.
Keywords :
decoding; error statistics; set theory; asymptotic analysis; asymptotic distribution; bit-flipping decoder; elementary fully absorbing set; error rate; regular sparse code ensemble; trapping set; Approximation methods; Charge carrier processes; Decoding; Equations; Finite element methods; Parity check codes; Signal to noise ratio;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Communications Theory Workshop (AusCTW), 2011 Australian
Conference_Location :
Melbourne, VIC
Print_ISBN :
978-1-4244-9714-0
Type :
conf
DOI :
10.1109/AUSCTW.2011.5728733
Filename :
5728733
Link To Document :
بازگشت