Analysis of connections between pseudocodewords

Nathan Axvig, Deanna Dreher, Katherine Morrison, Eric Psota, Lance C Perez, Judy L. Walker

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

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, and the minimal degree cover necessary to realize a pseudocodeword is found. Additionally, some conditions for the existence of connected realizations of graph cover pseudocodewords are given. This allows for further analysis of when graph cover pseudocodewords induce computation tree pseudocodewords. Finally, an example is offered that shows that existing theories on the distinction between graph cover pseudocodewords and computation tree pseudocodewords are incomplete.

Original languageEnglish (US)
Pages (from-to)4099-4107
Number of pages9
JournalIEEE Transactions on Information Theory
Volume55
Issue number9
DOIs
StatePublished - Sep 4 2009

Fingerprint

Decoding
programming
Linear programming
Message passing
literature

Keywords

  • Graph cover decoding
  • Iterative message-passing decoding
  • Linear programming decoding
  • Low-density parity-check (LDPC) codes
  • Pseudocodewords

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

Axvig, N., Dreher, D., Morrison, K., Psota, E., Perez, L. C., & Walker, J. L. (2009). Analysis of connections between pseudocodewords. IEEE Transactions on Information Theory, 55(9), 4099-4107. https://doi.org/10.1109/TIT.2009.2025529

Analysis of connections between pseudocodewords. / Axvig, Nathan; Dreher, Deanna; Morrison, Katherine; Psota, Eric; Perez, Lance C; Walker, Judy L.

In: IEEE Transactions on Information Theory, Vol. 55, No. 9, 04.09.2009, p. 4099-4107.

Research output: Contribution to journalArticle

Axvig, N, Dreher, D, Morrison, K, Psota, E, Perez, LC & Walker, JL 2009, 'Analysis of connections between pseudocodewords', IEEE Transactions on Information Theory, vol. 55, no. 9, pp. 4099-4107. https://doi.org/10.1109/TIT.2009.2025529
Axvig, Nathan ; Dreher, Deanna ; Morrison, Katherine ; Psota, Eric ; Perez, Lance C ; Walker, Judy L. / Analysis of connections between pseudocodewords. In: IEEE Transactions on Information Theory. 2009 ; Vol. 55, No. 9. pp. 4099-4107.
@article{a7221a6ead0c466b812ff39e5d23b879,
title = "Analysis of connections between pseudocodewords",
abstract = "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, and the minimal degree cover necessary to realize a pseudocodeword is found. Additionally, some conditions for the existence of connected realizations of graph cover pseudocodewords are given. This allows for further analysis of when graph cover pseudocodewords induce computation tree pseudocodewords. Finally, an example is offered that shows that existing theories on the distinction between graph cover pseudocodewords and computation tree pseudocodewords are incomplete.",
keywords = "Graph cover decoding, Iterative message-passing decoding, Linear programming decoding, Low-density parity-check (LDPC) codes, Pseudocodewords",
author = "Nathan Axvig and Deanna Dreher and Katherine Morrison and Eric Psota and Perez, {Lance C} and Walker, {Judy L.}",
year = "2009",
month = "9",
day = "4",
doi = "10.1109/TIT.2009.2025529",
language = "English (US)",
volume = "55",
pages = "4099--4107",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "9",

}

TY - JOUR

T1 - Analysis of connections between pseudocodewords

AU - Axvig, Nathan

AU - Dreher, Deanna

AU - Morrison, Katherine

AU - Psota, Eric

AU - Perez, Lance C

AU - Walker, Judy L.

PY - 2009/9/4

Y1 - 2009/9/4

N2 - 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, and the minimal degree cover necessary to realize a pseudocodeword is found. Additionally, some conditions for the existence of connected realizations of graph cover pseudocodewords are given. This allows for further analysis of when graph cover pseudocodewords induce computation tree pseudocodewords. Finally, an example is offered that shows that existing theories on the distinction between graph cover pseudocodewords and computation tree pseudocodewords are incomplete.

AB - 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, and the minimal degree cover necessary to realize a pseudocodeword is found. Additionally, some conditions for the existence of connected realizations of graph cover pseudocodewords are given. This allows for further analysis of when graph cover pseudocodewords induce computation tree pseudocodewords. Finally, an example is offered that shows that existing theories on the distinction between graph cover pseudocodewords and computation tree pseudocodewords are incomplete.

KW - Graph cover decoding

KW - Iterative message-passing decoding

KW - Linear programming decoding

KW - Low-density parity-check (LDPC) codes

KW - Pseudocodewords

UR - http://www.scopus.com/inward/record.url?scp=69449090759&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=69449090759&partnerID=8YFLogxK

U2 - 10.1109/TIT.2009.2025529

DO - 10.1109/TIT.2009.2025529

M3 - Article

AN - SCOPUS:69449090759

VL - 55

SP - 4099

EP - 4107

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 9

ER -