Analysis of Connections Between Pseudocodewords
Axvig, N.
Dreher, D.
Morrison, K.
Psota, E.
Perez, L.C.
Walker, J.L.
Dept. of Math., Univ. of Nebraska, Lincoln, NE, USA;
This paper appears in: Information Theory, IEEE Transactions on
Publication Date: Sept. 2009
Volume: 55,
Issue: 9
On page(s): 4099-4107
ISSN: 0018-9448
INSPEC Accession Number: 10828930
Digital Object Identifier: 10.1109/TIT.2009.2025529
Current Version Published: 2009-08-18
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.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
