An upper bound on the capacity of channels with memory and constraint input. - Pascal O. Vontobel; Dieter-Michael Arnold (ITW, 2001)

On the construction of turbo code interleavers based on graphs with large girth. - Pascal O. Vontobel (ICC, 2002)

On Factor Graphs and Electrical Networks. - Pascal O. Vontobel; Hans-Andrea Loeliger (Mathematical Systems Theory in Biology, Communications, Computation, and Finance, 2003)

Factor graphs and dynamical electrical networks. - Pascal O. Vontobel; Hans-Andrea Loeliger (ITW, 2003)

Algebraic coding for iterative decoding. - Pascal O. Vontobel (Hartung-Gorre, 2003)

A Factor-Graph Approach to the Context-Tree Weighting Method. - Pascal O. Vontobel (Data Compression Conference, 2004)

On regular quasicyclic LDPC codes from binomials. - Roxana Smarandache; Pascal O. Vontobel (ISIT, 2004)

Lower bounds on the minimum pseudoweight of linear codes. - Pascal O. Vontobel; Ralf Koetter (ISIT, 2004)

Pseudo-codewords of cycle codes via zeta functions. - Ralf Koetter; Wen-Ching W. Li; Pascal O. Vontobel; Judy L. Walker (ITW, 2004)

The benefit of thresholding in LP decoding of LDPC codes. - Jon Feldman; Ralf Koetter; Pascal O. Vontobel (ISIT, 2005)

On the minimal pseudo-codewords of codes from finite geometries. - Pascal O. Vontobel; Roxana Smarandache; Negar Kiyavash; Jason Teutsch; Dejan Vukobratovic (ISIT, 2005)

Characterizations of Pseudo-Codewords of LDPC Codes - Ralf Koetter; Wen-Ching W. Li; Pascal O. Vontobel; Judy L. Walker (CoRR, 2005)

An Explicit Construction of Universally Decodable Matrices - Pascal O. Vontobel; Ashwin Ganesan (CoRR, 2005)

On Minimal Pseudo-Codewords of Tanner Graphs from Projective Planes - Pascal O. Vontobel; Roxana Smarandache (CoRR, 2005)

Graph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of LDPC Codes - Pascal O. Vontobel; Ralf Koetter (CoRR, 2005)

Pseudo-Codewords in LDPC Convolutional Codes. - Roxana Smarandache; Ali Emre Pusane; Pascal O. Vontobel; Daniel J. Costello Jr. (ISIT, 2006)

Bounds on the Threshold of Linear Programming Decoding. - Pascal O. Vontobel; Ralf Koetter (ITW, 2006)

On the Block Error Probability of LP Decoding of LDPC Codes - Ralf Koetter; Pascal O. Vontobel (CoRR, 2006)

Towards Low-Complexity Linear-Programming Decoding - Pascal O. Vontobel; Ralf Koetter (CoRR, 2006)

Pseudo-Codeword Performance Analysis for LDPC Convolutional Codes - Roxana Smarandache; Ali Emre Pusane; Pascal O. Vontobel; Daniel J. Costello Jr. (CoRR, 2006)

On universally decodable matrices for space-time coding. - Pascal O. Vontobel; Ashwin Ganesan (Des. Codes Cryptogr., 2006)

Simulation-Based Computation of Information Rates for Channels With Memory. - Dieter-Michael Arnold; Hans-Andrea Loeliger; Pascal O. Vontobel; Aleksandar Kavcic; Wei Zeng 017 (IEEE Trans. Inf. Theory, 2006)

On Deriving Good LDPC Convolutional Codes from QC LDPC Block Codes. - Ali Emre Pusane; Roxana Smarandache; Pascal O. Vontobel; Daniel J. Costello Jr. (ISIT, 2007)

Optimizing Information Rate Bounds for Channels with Memory. - Parastoo Sadeghi; Pascal O. Vontobel; Ramtin Shams (ISIT, 2007)

On low-complexity linear-programming decoding of LDPC codes. - Pascal O. Vontobel; Ralf Koetter (Eur. Trans. Telecommun., 2007)

On the Existence of Universally Decodable Matrices. - Ashwin Ganesan; Pascal O. Vontobel (IEEE Trans. Inf. Theory, 2007)

Pseudo-Codeword Analysis of Tanner Graphs From Projective and Euclidean Planes. - Roxana Smarandache; Pascal O. Vontobel (IEEE Trans. Inf. Theory, 2007)

Symbolwise graph-cover decoding: Connecting sum-product algorithm decoding and bethe free energy minimization. - Pascal O. Vontobel (Allerton, 2008)

Interior-Point Algorithms for Linear-Programming Decoding - Pascal O. Vontobel (CoRR, 2008)

Stabilizer Quantum Codes: A Unified View based on Forney-style Factor Graphs - Pascal O. Vontobel (CoRR, 2008)

A Generalization of the Blahut-Arimoto Algorithm to Finite-State Channels. - Pascal O. Vontobel; Aleksandar Kavcic; Dieter-Michael Arnold; Hans-Andrea Loeliger (IEEE Trans. Inf. Theory, 2008)

LP decoding meets LP decoding: A connection between channel coding and compressed sensing. - Alexandros G. Dimakis; Pascal O. Vontobel (Allerton, 2009)

Absdet-pseudo-codewords and perm-pseudo-codewords: Definitions and properties. - Roxana Smarandache; Pascal O. Vontobel (ISIT, 2009)

List decoding of burst errors. - Ron M. Roth; Pascal O. Vontobel (IEEE Trans. Inf. Theory, 2009)

Optimization of Information Rate Upper and Lower Bounds for Channels With Memory. - Parastoo Sadeghi; Pascal O. Vontobel; Ramtin Shams (IEEE Trans. Inf. Theory, 2009)

Pseudocodeword performance analysis for LDPC convolutional codes. - Roxana Smarandache; Ali Emre Pusane; Pascal O. Vontobel; Daniel J. Costello Jr. (IEEE Trans. Inf. Theory, 2009)

The Bethe permanent of a non-negative matrix. - Pascal O. Vontobel (Allerton, 2010)

Connecting the Bethe entropy and the edge zeta function of a cycle code. - Pascal O. Vontobel (ISIT, 2010)

A factor-graph-based random walk, and its relevance for LP decoding analysis and Bethe entropy characterization. - Pascal O. Vontobel (ITA, 2010)

On linear balancing sets. - Arya Mazumdar; Ron M. Roth; Pascal O. Vontobel (Adv. Math. Commun., 2010)

Normal factor graphs: A diagrammatic approach to linear algebra. - Ali Al-Bashabsheh; Yongyi Mao; Pascal O. Vontobel (ISIT, 2011)

A factor-graph approach to Lagrangian and Hamiltonian dynamics. - Pascal O. Vontobel (ISIT, 2011)

A combinatorial characterization of the Bethe and the Kikuchi partition functions. - Pascal O. Vontobel (ITA, 2011)

Partition Functions of Normal Factor Graphs - G. David Forney Jr.; Pascal O. Vontobel (CoRR, 2011)

Deriving Good LDPC Convolutional Codes from LDPC Block Codes. - Ali Emre Pusane; Roxana Smarandache; Pascal O. Vontobel; Daniel J. Costello Jr. (IEEE Trans. Inf. Theory, 2011)

A factor-graph representation of probabilities in quantum mechanics. - Hans-Andrea Loeliger; Pascal O. Vontobel (ISIT, 2012)

Approximately counting the number of constrained arrays via the sum-product algorithm. - Farzad Parvaresh; Pascal O. Vontobel (ISIT, 2012)

The Bethe approximation of the pattern maximum likelihood distribution. - Pascal O. Vontobel (ISIT, 2012)

LDPC Codes for Compressed Sensing. - Alexandros G. Dimakis; Roxana Smarandache; Pascal O. Vontobel (IEEE Trans. Inf. Theory, 2012)

Quasi-Cyclic LDPC Codes: Influence of Proto- and Tanner-Graph Structure on Minimum Hamming Distance Upper Bounds. - Roxana Smarandache; Pascal O. Vontobel (IEEE Trans. Inf. Theory, 2012)

On the relevance of graph covers and zeta functions for the analysis of SPA decoding of cycle codes. - Henry D. Pfister; Pascal O. Vontobel (ISIT, 2013)

Low-Complexity LP Decoding of Nonbinary Linear Codes. - Mayur Punekar; Pascal O. Vontobel; Mark F. Flanagan (IEEE Trans. Commun., 2013)

The Bethe Permanent of a Nonnegative Matrix. - Pascal O. Vontobel (IEEE Trans. Inf. Theory, 2013)

Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function. - Pascal O. Vontobel (IEEE Trans. Inf. Theory, 2013)

Counting balanced sequencesw/o forbidden patterns via the betheapproximation and loop calculus. - Pascal O. Vontobel (ISIT, 2014)

The Bethe and Sinkhorn approximations of the pattern maximum likelihood estimate and their connections to the Valiant-Valiant estimate. - Pascal O. Vontobel (ITA, 2014)

Coding for Combined Block-Symbol Error Correction. - Ron M. Roth; Pascal O. Vontobel (IEEE Trans. Inf. Theory, 2014)

The ising model: Kramers-Wannier duality and normal factor graphs. - Ali Al-Bashabsheh; Pascal O. Vontobel (ISIT, 2015)

Generalized belief propagation for estimating the partition function of the 2D Ising model. - Chun Lam Chan; Mahdi Jafari Siavoshani; Sidharth Jaggi; Navin Kashyap; Pascal O. Vontobel (ISIT, 2015)

Bounds on the size of balls over permutations with the infinity metric. - Moshe Schwartz 001; Pascal O. Vontobel (ISIT, 2015)

Factor-graph representations of stabilizer quantum codes. - July X. Li; Pascal O. Vontobel (Allerton, 2016)

Pattern maximum likelihood estimation of finite-state discrete-time Markov chains. - Shashank Vatedka; Pascal O. Vontobel (ISIT, 2016)

Quantum factor graphs: Closing-the-box operation and variational approaches. - Michael X. Cao; Pascal O. Vontobel (ISITA, 2016)

Analysis of double covers of factor graphs. - Pascal O. Vontobel (SPCOM, 2016)

Kramers-Wannier Duality and Factor Graphs. - Ali Al-Bashabsheh; Pascal O. Vontobel (CoRR, 2016)

Estimating the information rate of a channel with classical input and output and a quantum state. - Michael X. Cao; Pascal O. Vontobel (ISIT, 2017)

Double-edge factor graphs: Definition, properties, and examples. - Michael X. Cao; Pascal O. Vontobel (ITW, 2017)

Estimating the Information Rate of a Channel with Classical Input and Output and a Quantum State (Extended Version). - Michael X. Cao; Pascal O. Vontobel (CoRR, 2017)

Factor Graphs for Quantum Probabilities. - Hans-Andrea Loeliger; Pascal O. Vontobel (IEEE Trans. Inf. Theory, 2017)

Improved Lower Bounds on the Size of Balls Over Permutations With the Infinity Metric. - Moshe Schwartz 001; Pascal O. Vontobel (IEEE Trans. Inf. Theory, 2017)

LP Decoding of Quantum Stabilizer Codes. - July X. Li; Pascal O. Vontobel (ISIT, 2018)

A Factor-Graph Approach to Algebraic Topology, With Applications to Kramers-Wannier Duality. - Ali Al-Bashabsheh; Pascal O. Vontobel (IEEE Trans. Inf. Theory, 2018)

Optimizing Bounds on the Classical Information Rate of Quantum Channels with Memory. - Michael X. Cao; Pascal O. Vontobel (ISIT, 2019)

Pseudocodeword-based Decoding of Quantum Stabilizer Codes. - July X. Li; Pascal O. Vontobel (ISIT, 2019)

Universally Decodable Matrices for Distributed Matrix-Vector Multiplication. - Aditya Ramamoorthy; Li Tang 004; Pascal O. Vontobel (ISIT, 2019)

Characterizing the Bethe Partition Function of Double-Edge Factor Graphs via Graph Covers. - Yuwen Huang; Pascal O. Vontobel (ISIT, 2020)

Modified Bethe Permanent of a Nonnegative Matrix. - Shashank Vatedka; Pascal O. Vontobel (SPCOM, 2020)

Bounding and Estimating the Classical Information Rate of Quantum Channels With Memory. - Michael X. Cao; Pascal O. Vontobel (IEEE Trans. Inf. Theory, 2020)

Quantum Measurement as Marginalization and Nested Quantum Systems. - Hans-Andrea Loeliger; Pascal O. Vontobel (IEEE Trans. Inf. Theory, 2020)

Sets of Marginals and Pearson-Correlation-based CHSH Inequalities for a Two-Qubit System. - Yuwen Huang; Pascal O. Vontobel (ISIT, 2021)

Pseudocodeword-based Decoding of Quantum Color Codes. - July X. Li; Joseph M. Renes; Pascal O. Vontobel (ISIT, 2021)

Finite-Input Intersymbol Interference Wiretap Channels. - Aria Nouri; Reza Asvadi; Jun Chen 005; Pascal O. Vontobel (ITW, 2021)

Constrained Secrecy Capacity of Partial-Response Wiretap Channels. - Aria Nouri; Reza Asvadi; Jun Chen 005; Pascal O. Vontobel (CoRR, 2021)

Using List Decoding to Improve the Finite-Length Performance of Sparse Regression Codes. - Haiwen Cao; Pascal O. Vontobel (IEEE Trans. Commun., 2021)

Sparse Regression Codes for MIMO Detection. - Haiwen Cao; Pascal O. Vontobel (ITW, 2022)

On the Relationship Between the Minimum of the Bethe Free Energy Function of a Factor Graph and Sum-Product Algorithm Fixed Points. - Yuwen Huang; Pascal O. Vontobel (ITW, 2022)

Double-Cover-Based Analysis of the Bethe Permanent of Non-negative Matrices. - Kit Shing Ng; Pascal O. Vontobel (ITW, 2022)

Bounding the Permanent of a Non-negative Matrix via its Degree- M Bethe and Sinkhorn Permanents. - Yuwen Huang; Pascal O. Vontobel (ISIT, 2023)

Degree-M Bethe and Sinkhorn Permanent Based Bounds on the Permanent of a Non-negative Matrix. - Yuwen Huang; Pascal O. Vontobel (CoRR, 2023)

Constrained Secrecy Capacity of Finite-Input Intersymbol Interference Wiretap Channels. - Aria Nouri; Reza Asvadi; Jun Chen 005; Pascal O. Vontobel (IEEE Trans. Commun., 2023)

The Bethe Partition Function and the SPA for Factor Graphs based on Homogeneous Real Stable Polynomials. - Yuwen Huang; Pascal O. Vontobel (ISIT, 2024)

Degree-M Bethe and Sinkhorn Permanent Based Bounds on the Permanent of a Non-Negative Matrix. - Yuwen Huang; Navin Kashyap; Pascal O. Vontobel (IEEE Trans. Inf. Theory, 2024)

Graph-Cover-based Characterization of the Bethe Partition Function of Double-Edge Factor Graphs. - Yuwen Huang; Pascal O. Vontobel (CoRR, 2025)

Understanding the ratio of the partition sum to its Bethe approximation via double covers. - Pascal O. Vontobel (CoRR, 2025)