Publication: Pseudocodeword-free criterion for codes with cycle-free Tanner graph
Issued Date
2018-12-01
Resource Type
ISSN
15737586
09251022
09251022
Other identifier(s)
2-s2.0-85044380173
Rights
Mahidol University
Rights Holder(s)
SCOPUS
Bibliographic Citation
Designs, Codes, and Cryptography. Vol.86, No.12 (2018), 2791-2805
Suggested Citation
Wittawat Kositwattanarerk Pseudocodeword-free criterion for codes with cycle-free Tanner graph. Designs, Codes, and Cryptography. Vol.86, No.12 (2018), 2791-2805. doi:10.1007/s10623-018-0476-3 Retrieved from: https://repository.li.mahidol.ac.th/handle/123456789/45539
Research Projects
Organizational Units
Authors
Journal Issue
Thesis
Title
Pseudocodeword-free criterion for codes with cycle-free Tanner graph
Author(s)
Other Contributor(s)
Abstract
© 2018, Springer Science+Business Media, LLC, part of Springer Nature. Iterative decoding and linear programming decoding are guaranteed to converge to the maximum-likelihood codeword when the underlying Tanner graph is cycle-free. Therefore, cycles are usually seen as the culprit of low-density parity-check codes. In this paper, we argue in the context of graph cover pseudocodeword that, for a code that permits a cycle-free Tanner graph, cycles have no effect on error performance as long as they are a part of redundant rows. Specifically, we characterize all parity-check matrices that are pseudocodeword-free for such class of codes.