Pseudo-Codeword Analysis of Tanner Graphs From Projective and Euclidean Planes

@article{Smarandache2007PseudoCodewordAO,
  title={Pseudo-Codeword Analysis of Tanner Graphs From Projective and Euclidean Planes},
  author={Roxana Smarandache and Pascal O. Vontobel},
  journal={IEEE Transactions on Information Theory},
  year={2007},
  volume={53},
  pages={2376-2393}
}
We consider coded data transmission over a binary-input output-symmetric memoryless channel using a binary linear code. In order to understand the performance of maximum-likelihood (ML) decoding, one studies the codewords, in particular the minimal codewords, and their Hamming weights. In the context of linear programming (LP) decoding, one's attention needs to be shifted to the pseudo-codewords, in particular, to the minimal pseudo-codewords and their pseudo-weights. In this paper, we… CONTINUE READING
Highly Cited
This paper has 42 citations. REVIEW CITATIONS