Title :
Efficient methods for bounding the fractional distance of LDPC codes and obtaining fundamental polytopes of nonbinary and generalized codes
Author :
Burshtein, David ; Goldenberg, Idan
Author_Institution :
Sch. of Electr. Eng., Tel-Aviv Univ., Tel-Aviv, Israel
fDate :
July 31 2011-Aug. 5 2011
Abstract :
A method which obtains a tight lower bound on the fractional distance of LDPC codes is proposed. This algorithm exhibits complexity which scales quadratically with the block length, and thus less than currently-known methods. We also show how the fundamental LP polytope for generalized LDPC codes and nonbinary LDPC codes can be obtained.
Keywords :
binary codes; linear codes; linear programming; parity check codes; currently-known method; fractional distance bounding; fundamental LP polytope; fundamental linear programming polytope; generalized code; lower bound; nonbinary LDPC code; Approximation algorithms; Computational complexity; Decoding; Iterative decoding; Linear programming; Linear programming decoding; fractional distance; fundamental polytope; low-density parity-check (LDPC) codes;
Conference_Titel :
Information Theory Proceedings (ISIT), 2011 IEEE International Symposium on
Conference_Location :
St. Petersburg
Print_ISBN :
978-1-4577-0596-0
Electronic_ISBN :
2157-8095
DOI :
10.1109/ISIT.2011.6033739
