DocumentCode
3513566
Title
Enumerators for protograph-based ensembles of nonbinary LDPC codes
Author
Divsalar, Dariush ; Dolecek, Lara
Author_Institution
Jet Propulsion Lab., California Inst. of Technol., Pasadena, CA, USA
fYear
2011
fDate
July 31 2011-Aug. 5 2011
Firstpage
913
Lastpage
917
Abstract
This paper considers the ensemble enumerators of protograph-based nonbinary (PB NB) LDPC codes. Equipped with combinatorial definitions extended to the nonbinary domain, ensemble enumerators of codeword weight, trapping set size and stopping set size are calculated. The exact enumerators are presented in the finite-length regime, and the corresponding growth rates are calculated in the asymptotic regime. Our results can provide useful analytical tools for a range of communication and storage applications employing nonbinary LDPC codes.
Keywords
combinatorial mathematics; parity check codes; codeword weight; combinatorial definitions; ensemble enumerators; finite-length regime; protograph-based ensembles; protograph-based nonbinary LDPC codes; stopping set size; trapping set size; Block codes; Charge carrier processes; Decoding; Hamming weight; Matrix converters; Niobium; Parity check codes;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on
Conference_Location
St. Petersburg
ISSN
2157-8095
Print_ISBN
978-1-4577-0596-0
Electronic_ISBN
2157-8095
Type
conf
DOI
10.1109/ISIT.2011.6034271
Filename
6034271
Link To Document