A Universal Theory of Pseudocodewords

Authors

Nathan Axvig, University of Nebraska - LincolnFollow
Emily Price, University of Nebraska - Lincoln
Eric T. Psota, University of Nebraska-LincolnFollow
Deanna Turk, University of Nebraska - Lincoln
Lance C. Pérez, University of Nebraska-LincolnFollow
Judy L. Walker, University of Nebraska - LincolnFollow

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.