DocumentCode :
3122875
Title :
Graph cover ensembles of non-binary protograph LDPC codes
Author :
Divsalar, Dariush ; Dolecek, Lara
Author_Institution :
Jet Propulsion Lab., California Inst. of Technol., Pasadena, CA, USA
fYear :
2012
fDate :
1-6 July 2012
Firstpage :
2526
Lastpage :
2530
Abstract :
This paper introduces a novel class of non-binary graph-based codes, built upon graph covers of non-binary protograph LDPC codes. This new ensemble is more restrictive than previously considered constructions, but in turn is much simpler to design and implement. The simplifications in design allow for the enumeration of codeword weight, trapping set size, stopping set size, and pseudo codeword weights, both as exact quantities in the finite-length regime and as corresponding growth rates in the asymptotic setting. The presented construction and the accompanying enumerations enhance the analytical toolbox of non-binary LDPC codes.
Keywords :
graph theory; parity check codes; finite length; graph cover; nonbinary graph based code; nonbinary protograph LDPC codes; pseudo codeword weight; stopping set size; trapping set size; Charge carrier processes; Frequency modulation; Hamming weight; Niobium; Parity check codes; Vectors;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory Proceedings (ISIT), 2012 IEEE International Symposium on
Conference_Location :
Cambridge, MA
ISSN :
2157-8095
Print_ISBN :
978-1-4673-2580-6
Electronic_ISBN :
2157-8095
Type :
conf
DOI :
10.1109/ISIT.2012.6283972
Filename :
6283972
Link To Document :
بازگشت