A universal theory of pseudocodewords

Nathan Axvig, Emily Price, Eric Psota, Deanna Turk, Lance C. Pérez, Judy L. Walker

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Scopus citations

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.

Original languageEnglish (US)
Title of host publication45th Annual Allerton Conference on Communication, Control, and Computing 2007
PublisherUniversity of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering
Pages336-343
Number of pages8
ISBN (Electronic)9781605600864
StatePublished - 2007
Event45th Annual Allerton Conference on Communication, Control, and Computing 2007 - Monticello, United States
Duration: Sep 26 2007Sep 28 2007

Publication series

Name45th Annual Allerton Conference on Communication, Control, and Computing 2007
Volume1

Other

Other45th Annual Allerton Conference on Communication, Control, and Computing 2007
CountryUnited States
CityMonticello
Period9/26/079/28/07

ASJC Scopus subject areas

  • Computer Science Applications
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'A universal theory of pseudocodewords'. Together they form a unique fingerprint.

Cite this