221 citations · 966 across the 44 of their papers we have counts for
7 papers · 1 filter
Graph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of LDPC Codes
Pascal O. Vontobel, Ralf Koetter
The goal of the present paper is the derivation of a framework for the finite-length analysis of message-passing iterative decoding of low-density parity-check codes. To this end w…
On Minimal Pseudo-Codewords of Tanner Graphs from Projective Planes
Pascal O. Vontobel, Roxana Smarandache
We would like to better understand the fundamental cone of Tanner graphs derived from finite projective planes. Towards this goal, we discuss bounds on the AWGNC and BSC pseudo-wei…
An Explicit Construction of Universally Decodable Matrices
Pascal O. Vontobel, Ashwin Ganesan
Universally decodable matrices can be used for coding purposes when transmitting over slow fading channels. These matrices are parameterized by positive integers and and a…
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…
On the Minimal Pseudo-Codewords of Codes from Finite Geometries
Pascal O. Vontobel, Roxana Smarandache, Negar Kiyavash +2
In order to understand the performance of a code under maximum-likelihood (ML) decoding, it is crucial to know the minimal codewords. In the context of linear programming (LP) deco…
The Benefit of Thresholding in LP Decoding of LDPC Codes
Jon Feldman, Ralf Koetter, Pascal O. Vontobel
Consider data transmission over a binary-input additive white Gaussian noise channel using a binary low-density parity-check code. We ask the following question: Given a decoder th…