Mathematics, Department of
Department of Mathematics: Faculty Publications
Accessibility Remediation
If you are unable to use this item in its current form due to accessibility barriers, you may request remediation through our remediation request form.
Document Type
Article
Date of this Version
10-2007
Citation
Published in Proceedings of the 45th Annual Allerton Conference on Communication, Control and Computing, Monticello, IL; October 2007.
Abstract
Three types of pseudocodewords for LDPC codes are found in the literature: graph cover pseudocodewords, linear programming pseudocodewords, and computation tree pseudocodewords. In this paper we first review these three notions and known connections between them. We then propose a new decoding rule — universal cover decoding — for LDPC codes. This new decoding rule also has a notion of pseudocodeword attached, and this fourth notion provides a framework in which we can better understand the other three.
Included in
Applied Mathematics Commons, Electrical and Computer Engineering Commons, Mathematics Commons