Pascal O. Vontobel

Navin Kashyap

IEEE Trans. Inf. Theory, July, 2024

The Bethe Partition Function and the SPA for Factor Graphs based on Homogeneous Real Stable Polynomials.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2024

2023

Constrained Secrecy Capacity of Finite-Input Intersymbol Interference Wiretap Channels.

[BibT_eX]

[DOI]

IEEE Trans. Commun., 2023

Degree-M Bethe and Sinkhorn Permanent Based Bounds on the Permanent of a Non-negative Matrix.

[BibT_eX]

[DOI]

CoRR, 2023

Bounding the Permanent of a Non-negative Matrix via its Degree- M Bethe and Sinkhorn Permanents.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2023

2022

Double-Cover-Based Analysis of the Bethe Permanent of Non-negative Matrices.

[BibT_eX]

[DOI]

Kit Shing Ng

Proceedings of the IEEE Information Theory Workshop, 2022

On the Relationship Between the Minimum of the Bethe Free Energy Function of a Factor Graph and Sum-Product Algorithm Fixed Points.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2022

Sparse Regression Codes for MIMO Detection.

[BibT_eX]

[DOI]

Haiwen Cao

Proceedings of the IEEE Information Theory Workshop, 2022

2021

Using List Decoding to Improve the Finite-Length Performance of Sparse Regression Codes.

[BibT_eX]

[DOI]

Haiwen Cao

IEEE Trans. Commun., 2021

Constrained Secrecy Capacity of Partial-Response Wiretap Channels.

[BibT_eX]

[DOI]

CoRR, 2021

Finite-Input Intersymbol Interference Wiretap Channels.

[BibT_eX]

[DOI]

Proceedings of the IEEE Information Theory Workshop, 2021

Pseudocodeword-based Decoding of Quantum Color Codes.

[BibT_eX]

[DOI]

Joseph M. Renes

Proceedings of the IEEE International Symposium on Information Theory, 2021

Sets of Marginals and Pearson-Correlation-based CHSH Inequalities for a Two-Qubit System.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

Quantum Measurement as Marginalization and Nested Quantum Systems.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Bounding and Estimating the Classical Information Rate of Quantum Channels With Memory.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Modified Bethe Permanent of a Nonnegative Matrix.

[BibT_eX]

[DOI]

Shashank Vatedka

Proceedings of the International Conference on Signal Processing and Communications, 2020

Characterizing the Bethe Partition Function of Double-Edge Factor Graphs via Graph Covers.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2020

2019

Universally Decodable Matrices for Distributed Matrix-Vector Multiplication.

[BibT_eX]

[DOI]

Aditya Ramamoorthy

Li Tang

Proceedings of the IEEE International Symposium on Information Theory, 2019

Pseudocodeword-based Decoding of Quantum Stabilizer Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

Optimizing Bounds on the Classical Information Rate of Quantum Channels with Memory.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2019

2018

A Factor-Graph Approach to Algebraic Topology, With Applications to Kramers-Wannier Duality.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2018

LP Decoding of Quantum Stabilizer Codes.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017

Improved Lower Bounds on the Size of Balls Over Permutations With the Infinity Metric.

[BibT_eX]

[DOI]

Moshe Schwartz

IEEE Trans. Inf. Theory, 2017

Factor Graphs for Quantum Probabilities.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2017

Estimating the Information Rate of a Channel with Classical Input and Output and a Quantum State (Extended Version).

[BibT_eX]

[DOI]

CoRR, 2017

Double-edge factor graphs: Definition, properties, and examples.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE Information Theory Workshop, 2017

Estimating the information rate of a channel with classical input and output and a quantum state.

[BibT_eX]

[DOI]

Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016

Analysis of Double Covers of Factor Graphs.

[BibT_eX]

[DOI]

CoRR, 2016

Kramers-Wannier Duality and Factor Graphs.

[BibT_eX]

[DOI]

CoRR, 2016

Quantum factor graphs: Closing-the-box operation and variational approaches.

[BibT_eX]

[DOI]

Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016

Pattern maximum likelihood estimation of finite-state discrete-time Markov chains.

[BibT_eX]

[DOI]

Shashank Vatedka

Proceedings of the IEEE International Symposium on Information Theory, 2016

Factor-graph representations of stabilizer quantum codes.

[BibT_eX]

[DOI]

Proceedings of the 54th Annual Allerton Conference on Communication, 2016

2015

Bounds on the size of balls over permutations with the infinity metric.

[BibT_eX]

[DOI]

Moshe Schwartz

Proceedings of the IEEE International Symposium on Information Theory, 2015

Generalized belief propagation for estimating the partition function of the 2D Ising model.

[BibT_eX]

[DOI]

Chun Lam Chan

Mahdi Jafari Siavoshani

Sidharth Jaggi

Navin Kashyap

Proceedings of the IEEE International Symposium on Information Theory, 2015

The ising model: Kramers-Wannier duality and normal factor graphs.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2015

2014

Coding for Combined Block-Symbol Error Correction.

[BibT_eX]

[DOI]

Ron M. Roth

IEEE Trans. Inf. Theory, 2014

The Bethe and Sinkhorn approximations of the pattern maximum likelihood estimate and their connections to the Valiant-Valiant estimate.

[BibT_eX]

[DOI]

Proceedings of the 2014 Information Theory and Applications Workshop, 2014

Counting balanced sequencesw/o forbidden patterns via the betheapproximation and loop calculus.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2013

Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

The Bethe Permanent of a Nonnegative Matrix.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Low-Complexity LP Decoding of Nonbinary Linear Codes.

[BibT_eX]

[DOI]

Mayur Punekar

Mark F. Flanagan

IEEE Trans. Commun., 2013

On the relevance of graph covers and zeta functions for the analysis of SPA decoding of cycle codes.

[BibT_eX]

[DOI]

Henry D. Pfister

Proceedings of the 2013 IEEE International Symposium on Information Theory, 2013

2012

Quasi-Cyclic LDPC Codes: Influence of Proto- and Tanner-Graph Structure on Minimum Hamming Distance Upper Bounds.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2012

LDPC Codes for Compressed Sensing.

[BibT_eX]

[DOI]

Alexandros G. Dimakis

IEEE Trans. Inf. Theory, 2012

The Bethe approximation of the pattern maximum likelihood distribution.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

Approximately counting the number of constrained arrays via the sum-product algorithm.

[BibT_eX]

[DOI]

Farzad Parvaresh

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

A factor-graph representation of probabilities in quantum mechanics.

[BibT_eX]

[DOI]

Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011

Deriving Good LDPC Convolutional Codes from LDPC Block Codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2011

Partition Functions of Normal Factor Graphs

[BibT_eX]

[DOI]

G. David Forney Jr.

CoRR, 2011

A combinatorial characterization of the Bethe and the Kikuchi partition functions.

[BibT_eX]

[DOI]

Proceedings of the Information Theory and Applications Workshop, 2011

A factor-graph approach to Lagrangian and Hamiltonian dynamics.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

Normal factor graphs: A diagrammatic approach to linear algebra.

[BibT_eX]

[DOI]

Yongyi Mao

Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011

2010

On linear balancing sets.

[BibT_eX]

[DOI]

Arya Mazumdar

Ron M. Roth

Adv. Math. Commun., 2010

A factor-graph-based random walk, and its relevance for LP decoding analysis and Bethe entropy characterization.

[BibT_eX]

[DOI]

Proceedings of the Information Theory and Applications Workshop, 2010

Connecting the Bethe entropy and the edge zeta function of a cycle code.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2010

The Bethe permanent of a non-negative matrix.

[BibT_eX]

[DOI]

Proceedings of the 48th Annual Allerton Conference on Communication, 2010

2009

Pseudocodeword performance analysis for LDPC convolutional codes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2009

Optimization of Information Rate Upper and Lower Bounds for Channels With Memory.

[BibT_eX]

[DOI]

Parastoo Sadeghi

Ramtin Shams

IEEE Trans. Inf. Theory, 2009

List decoding of burst errors.

[BibT_eX]

[DOI]

Ron M. Roth

IEEE Trans. Inf. Theory, 2009

Absdet-pseudo-codewords and perm-pseudo-codewords: Definitions and properties.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2009

LP decoding meets LP decoding: A connection between channel coding and compressed sensing.

[BibT_eX]

[DOI]

Alexandros G. Dimakis

Proceedings of the 47th Annual Allerton Conference on Communication, 2009

2008

A Generalization of the Blahut-Arimoto Algorithm to Finite-State Channels.

[BibT_eX]

[DOI]

Aleksandar Kavcic

Dieter-Michael Arnold

IEEE Trans. Inf. Theory, 2008

Stabilizer Quantum Codes: A Unified View based on Forney-style Factor Graphs

[BibT_eX]

[DOI]

CoRR, 2008

Interior-Point Algorithms for Linear-Programming Decoding

[BibT_eX]

[DOI]

CoRR, 2008

Symbolwise graph-cover decoding: Connecting sum-product algorithm decoding and bethe free energy minimization.

[BibT_eX]

[DOI]

Proceedings of the 46th Annual Allerton Conference on Communication, 2008

2007

Pseudo-Codeword Analysis of Tanner Graphs From Projective and Euclidean Planes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2007

On the Existence of Universally Decodable Matrices.

[BibT_eX]

[DOI]

Ashwin Ganesan

IEEE Trans. Inf. Theory, 2007

On low-complexity linear-programming decoding of LDPC codes.

[BibT_eX]

[DOI]

Eur. Trans. Telecommun., 2007

Optimizing Information Rate Bounds for Channels with Memory.

[BibT_eX]

[DOI]

Parastoo Sadeghi

Ramtin Shams

Proceedings of the IEEE International Symposium on Information Theory, 2007

On Deriving Good LDPC Convolutional Codes from QC LDPC Block Codes.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2007

2006

Simulation-Based Computation of Information Rates for Channels With Memory.

[BibT_eX]

[DOI]

Dieter-Michael Arnold

IEEE Trans. Inf. Theory, 2006

On universally decodable matrices for space-time coding.

[BibT_eX]

[DOI]

Ashwin Ganesan

Des. Codes Cryptogr., 2006

Pseudo-Codeword Performance Analysis for LDPC Convolutional Codes

[BibT_eX]

[DOI]

CoRR, 2006

Towards Low-Complexity Linear-Programming Decoding

[BibT_eX]

[DOI]

CoRR, 2006

On the Block Error Probability of LP Decoding of LDPC Codes

[BibT_eX]

[DOI]

CoRR, 2006

Bounds on the Threshold of Linear Programming Decoding.

[BibT_eX]

[DOI]

Proceedings of the 2006 IEEE Information Theory Workshop, 2006

Pseudo-Codewords in LDPC Convolutional Codes.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2006 IEEE International Symposium on Information Theory, 2006

2005

Graph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of LDPC Codes

[BibT_eX]

[DOI]

CoRR, 2005

On Minimal Pseudo-Codewords of Tanner Graphs from Projective Planes

[BibT_eX]

[DOI]

CoRR, 2005

An Explicit Construction of Universally Decodable Matrices

[BibT_eX]

[DOI]

Ashwin Ganesan

CoRR, 2005

Characterizations of Pseudo-Codewords of LDPC Codes

[BibT_eX]

[DOI]

CoRR, 2005

On the minimal pseudo-codewords of codes from finite geometries.

[BibT_eX]

[DOI]

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

The benefit of thresholding in LP decoding of LDPC codes.

[BibT_eX]

[DOI]

Jon Feldman

Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005

2004

Pseudo-codewords of cycle codes via zeta functions.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE Information Theory Workshop, 2004

Lower bounds on the minimum pseudoweight of linear codes.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

On regular quasicyclic LDPC codes from binomials.

[BibT_eX]

[DOI]

Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004

A Factor-Graph Approach to the Context-Tree Weighting Method.

[BibT_eX]

[DOI]

Proceedings of the 2004 Data Compression Conference (DCC 2004), 2004

2003

Algebraic coding for iterative decoding.

[BibT_eX]

[DOI]

PhD thesis, 2003

Factor graphs and dynamical electrical networks.

[BibT_eX]

[DOI]

Proceedings of the Proceedings 2003 IEEE Information Theory Workshop, 2003

On Factor Graphs and Electrical Networks.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Systems Theory in Biology, 2003

2002

On the construction of turbo code interleavers based on graphs with large girth.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Conference on Communications, 2002

2001

An upper bound on the capacity of channels with memory and constraint input.

[BibT_eX]

[DOI]