Analysis of Connections Between Pseudocodewords

@article{Axvig2009AnalysisOC,
  title={Analysis of Connections Between Pseudocodewords},
  author={Nathan Axvig and Deanna Dreher and Katherine Morrison and Eric Psota and Lance C. P{\'e}rez and Judy L. Walker},
  journal={IEEE Transactions on Information Theory},
  year={2009},
  volume={55},
  pages={4099-4107}
}
The role of pseudocodewords in causing non-codeword outputs in linear programming decoding, graph cover decoding, and iterative message-passing decoding is investigated. The three main types of pseudocodewords in the literature-linear programming pseudocodewords, graph cover pseudocodewords, and computation tree pseudocodewords-are reviewed and connections between them are explored. Some discrepancies in the literature on minimal and irreducible pseudocodewords are highlighted and clarified… CONTINUE READING
Highly Cited
This paper has 26 citations. REVIEW CITATIONS
13 Citations
18 References
Similar Papers

Similar Papers

Loading similar papers…