A universal theory of pseudocodewords

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

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 proceeding › Conference contribution

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 language	English (US)
Title of host publication	45th Annual Allerton Conference on Communication, Control, and Computing 2007
Publisher	University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering
Pages	336-343
Number of pages	8
ISBN (Electronic)	9781605600864
State	Published - 2007
Event	45th Annual Allerton Conference on Communication, Control, and Computing 2007 - Monticello, United States Duration: Sep 26 2007 → Sep 28 2007

Publication series

Name	45th Annual Allerton Conference on Communication, Control, and Computing 2007
Volume	1

Other

Other	45th Annual Allerton Conference on Communication, Control, and Computing 2007
Country/Territory	United States
City	Monticello
Period	9/26/07 → 9/28/07

ASJC Scopus subject areas

Computer Science Applications
Computer Networks and Communications

Cite this

Axvig, N., Price, E., Psota, E., Turk, D., Pérez, L. C., & Walker, J. L. (2007). A universal theory of pseudocodewords. In 45th Annual Allerton Conference on Communication, Control, and Computing 2007 (pp. 336-343). (45th Annual Allerton Conference on Communication, Control, and Computing 2007; Vol. 1). University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering.

A universal theory of pseudocodewords. / Axvig, Nathan; Price, Emily; Psota, Eric et al.

45th Annual Allerton Conference on Communication, Control, and Computing 2007. University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering, 2007. p. 336-343 (45th Annual Allerton Conference on Communication, Control, and Computing 2007; Vol. 1).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Axvig, N, Price, E, Psota, E, Turk, D, Pérez, LC & Walker, JL 2007, A universal theory of pseudocodewords. in 45th Annual Allerton Conference on Communication, Control, and Computing 2007. 45th Annual Allerton Conference on Communication, Control, and Computing 2007, vol. 1, University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering, pp. 336-343, 45th Annual Allerton Conference on Communication, Control, and Computing 2007, Monticello, United States, 9/26/07.

Axvig N, Price E, Psota E, Turk D, Pérez LC, Walker JL. A universal theory of pseudocodewords. In 45th Annual Allerton Conference on Communication, Control, and Computing 2007. University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering. 2007. p. 336-343. (45th Annual Allerton Conference on Communication, Control, and Computing 2007).

Axvig, Nathan ; Price, Emily ; Psota, Eric et al. / A universal theory of pseudocodewords. 45th Annual Allerton Conference on Communication, Control, and Computing 2007. University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering, 2007. pp. 336-343 (45th Annual Allerton Conference on Communication, Control, and Computing 2007).

@inproceedings{0b87dd6518c249a1a7cda24b4a7427d3,

title = "A universal theory of pseudocodewords",

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.",

author = "Nathan Axvig and Emily Price and Eric Psota and Deanna Turk and P{\'e}rez, {Lance C.} and Walker, {Judy L.}",

year = "2007",

language = "English (US)",

series = "45th Annual Allerton Conference on Communication, Control, and Computing 2007",

publisher = "University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering",

pages = "336--343",

booktitle = "45th Annual Allerton Conference on Communication, Control, and Computing 2007",

note = "45th Annual Allerton Conference on Communication, Control, and Computing 2007 ; Conference date: 26-09-2007 Through 28-09-2007",

}

TY - GEN

T1 - A universal theory of pseudocodewords

AU - Axvig, Nathan

AU - Price, Emily

AU - Psota, Eric

AU - Turk, Deanna

AU - Pérez, Lance C.

AU - Walker, Judy L.

PY - 2007

Y1 - 2007

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84940662656&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84940662656&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84940662656

T3 - 45th Annual Allerton Conference on Communication, Control, and Computing 2007

SP - 336

EP - 343

BT - 45th Annual Allerton Conference on Communication, Control, and Computing 2007

PB - University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering

T2 - 45th Annual Allerton Conference on Communication, Control, and Computing 2007

Y2 - 26 September 2007 through 28 September 2007

ER -

A universal theory of pseudocodewords

Abstract

Publication series

Other

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this