Title :
Pseudocodeword weights and stopping sets
Author :
Kelley, Christine ; Sridhara, Deepak ; Xu, Jun ; Rosenthal, Joachim
Author_Institution :
Dept. of Math., Notre Dame Univ., IN, USA
fDate :
27 June-2 July 2004
Abstract :
We examine the structure of pseudocodewords in Tanner graphs and derive lower bounds of pseudocodeword weights. The weight of a pseudocodeword is related to the size of its support set, which forms a stopping set in the Tanner graph.
Keywords :
graph theory; pseudonoise codes; Tanner graph; pseudocodeword weight; stopping set; AWGN channels; Bipartite graph; Constraint theory; Convergence; Iterative decoding; Mathematics; Maximum likelihood decoding; Parity check codes; Upper bound;
Conference_Titel :
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Print_ISBN :
0-7803-8280-3
DOI :
10.1109/ISIT.2004.1365105
