Title :
Towards universal cover decoding
Author :
Axvig, Nathan ; Dreher, Deanna ; Morrison, Katherine ; Psota, Eric ; Pérez, Lance C. ; Walker, Judy L.
Author_Institution :
Dept. of Math., Univ. of Nebraska-Lincoln, Lincoln, NE
Abstract :
In this paper, the non-codeword errors was analyzed that occur during parallel, iterative decoding with the min-sum decoder. Recently, work has been done relating the min-sum decoder to the linear programming (LP) decoder via graph covers. The LP decoder recasts the problem of decoding as an optimization problem whose feasible set is a polytope defined by the parity-check matrix of a code. It was shown that LP decoding can be realized as a decoder operating on graph covers.
Keywords :
iterative decoding; linear programming; parity check codes; graph covers; iterative decoding; linear programming decoder; min-sum decoder; noncodeword errors; optimization problem; parity-check matrix; universal cover decoding; Bipartite graph; Computational efficiency; Cost function; Information theory; Iterative algorithms; Iterative decoding; Mathematics; Parity check codes; TV; Tree graphs;
Conference_Titel :
Information Theory and Its Applications, 2008. ISITA 2008. International Symposium on
Conference_Location :
Auckland
Print_ISBN :
978-1-4244-2068-1
Electronic_ISBN :
978-1-4244-2069-8
DOI :
10.1109/ISITA.2008.4895386
