activity
20052017
most citedCharacterizations of Pseudo-Codewords of LDPC Codes

23 citations · 27 across the 5 of their papers we have counts for

collaborators

5 papers

cs.IT2017★ 1 cited

Representations of the Multicast Network Problem

Sarah E. Anderson, Wael Halbawi, Nathan Kaplan +4

We approach the problem of linear network coding for multicast networks from different perspectives. We introduce the notion of the coding points of a network, which are edges of t…

cs.IT2015★ 1 cited

Matched Metrics and Channels

Marcelo Firer, Judy L. Walker

The most common decision criteria for decoding are maximum likelihood decoding and nearest neighbor decoding. It is well-known that maximum likelihood decoding coincides with neare…

q-bio.NC2012

Combinatorial neural codes from a mathematical coding theory perspective

Carina Curto, Vladimir Itskov, Katherine Morrison +2

Shannon's seminal 1948 work gave rise to two distinct areas of research: information theory and mathematical coding theory. While information theory has had a strong influence on t…

cs.IT2005★ 23 cited

Characterizations of Pseudo-Codewords of LDPC Codes

Ralf Koetter, Wen-Ching W. Li, Pascal O. Vontobel +1

An important property of high-performance, low complexity codes is the existence of highly efficient algorithms for their decoding. Many of the most efficient, recent graph-based a…

cs.IT2005★ 2 cited

Pseudo-Codewords of Cycle Codes via Zeta Functions

Ralf Koetter, Wen-Ching W. Li, Pascal O. Vontobel +1

Cycle codes are a special case of low-density parity-check (LDPC) codes and as such can be decoded using an iterative message-passing decoding algorithm on the associated Tanner gr…