Pascal O. Vontobel
Orcid: 0000-0002-6180-258XAffiliations:
- The Chinese University of Hong Kong
- Hewlett Packard Development Company
According to our database1,
Pascal O. Vontobel
authored at least 91 papers
between 2001 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
-
on dl.acm.org
On csauthors.net:
Bibliography
2024
Degree-M Bethe and Sinkhorn Permanent Based Bounds on the Permanent of a Non-Negative Matrix.
IEEE Trans. Inf. Theory, July, 2024
2023
Constrained Secrecy Capacity of Finite-Input Intersymbol Interference Wiretap Channels.
IEEE Trans. Commun., 2023
Degree-M Bethe and Sinkhorn Permanent Based Bounds on the Permanent of a Non-negative Matrix.
CoRR, 2023
Bounding the Permanent of a Non-negative Matrix via its Degree- M Bethe and Sinkhorn Permanents.
Proceedings of the IEEE International Symposium on Information Theory, 2023
2022
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.
Proceedings of the IEEE Information Theory Workshop, 2022
Proceedings of the IEEE Information Theory Workshop, 2022
2021
Using List Decoding to Improve the Finite-Length Performance of Sparse Regression Codes.
IEEE Trans. Commun., 2021
Proceedings of the IEEE Information Theory Workshop, 2021
Proceedings of the IEEE International Symposium on Information Theory, 2021
Sets of Marginals and Pearson-Correlation-based CHSH Inequalities for a Two-Qubit System.
Proceedings of the IEEE International Symposium on Information Theory, 2021
2020
IEEE Trans. Inf. Theory, 2020
Bounding and Estimating the Classical Information Rate of Quantum Channels With Memory.
IEEE Trans. Inf. Theory, 2020
Proceedings of the International Conference on Signal Processing and Communications, 2020
Characterizing the Bethe Partition Function of Double-Edge Factor Graphs via Graph Covers.
Proceedings of the IEEE International Symposium on Information Theory, 2020
2019
Proceedings of the IEEE International Symposium on Information Theory, 2019
Proceedings of the IEEE International Symposium on Information Theory, 2019
Proceedings of the IEEE International Symposium on Information Theory, 2019
2018
A Factor-Graph Approach to Algebraic Topology, With Applications to Kramers-Wannier Duality.
IEEE Trans. Inf. Theory, 2018
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.
IEEE Trans. Inf. Theory, 2017
Estimating the Information Rate of a Channel with Classical Input and Output and a Quantum State (Extended Version).
CoRR, 2017
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.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017
2016
Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016
Proceedings of the IEEE International Symposium on Information Theory, 2016
Proceedings of the 54th Annual Allerton Conference on Communication, 2016
2015
Proceedings of the IEEE International Symposium on Information Theory, 2015
Generalized belief propagation for estimating the partition function of the 2D Ising model.
Proceedings of the IEEE International Symposium on Information Theory, 2015
Proceedings of the IEEE International Symposium on Information Theory, 2015
2014
The Bethe and Sinkhorn approximations of the pattern maximum likelihood estimate and their connections to the Valiant-Valiant estimate.
Proceedings of the 2014 Information Theory and Applications Workshop, 2014
Counting balanced sequencesw/o forbidden patterns via the betheapproximation and loop calculus.
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.
IEEE Trans. Inf. Theory, 2013
On the relevance of graph covers and zeta functions for the analysis of SPA decoding of cycle codes.
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.
IEEE Trans. Inf. Theory, 2012
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012
Approximately counting the number of constrained arrays via the sum-product algorithm.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012
2011
IEEE Trans. Inf. Theory, 2011
Proceedings of the Information Theory and Applications Workshop, 2011
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011
2010
A factor-graph-based random walk, and its relevance for LP decoding analysis and Bethe entropy characterization.
Proceedings of the Information Theory and Applications Workshop, 2010
Proceedings of the IEEE International Symposium on Information Theory, 2010
Proceedings of the 48th Annual Allerton Conference on Communication, 2010
2009
IEEE Trans. Inf. Theory, 2009
IEEE Trans. Inf. Theory, 2009
Proceedings of the IEEE International Symposium on Information Theory, 2009
LP decoding meets LP decoding: A connection between channel coding and compressed sensing.
Proceedings of the 47th Annual Allerton Conference on Communication, 2009
2008
IEEE Trans. Inf. Theory, 2008
CoRR, 2008
Symbolwise graph-cover decoding: Connecting sum-product algorithm decoding and bethe free energy minimization.
Proceedings of the 46th Annual Allerton Conference on Communication, 2008
2007
IEEE Trans. Inf. Theory, 2007
Eur. Trans. Telecommun., 2007
Proceedings of the IEEE International Symposium on Information Theory, 2007
Proceedings of the IEEE International Symposium on Information Theory, 2007
2006
IEEE Trans. Inf. Theory, 2006
Proceedings of the 2006 IEEE Information Theory Workshop, 2006
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
CoRR, 2005
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005
2004
Proceedings of the 2004 IEEE Information Theory Workshop, 2004
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004
Proceedings of the 2004 IEEE International Symposium on Information Theory, 2004
Proceedings of the 2004 Data Compression Conference (DCC 2004), 2004
2003
Proceedings of the Proceedings 2003 IEEE Information Theory Workshop, 2003
Proceedings of the Mathematical Systems Theory in Biology, 2003
2002
Proceedings of the IEEE International Conference on Communications, 2002
2001
Proceedings of the 2001 IEEE Information Theory Workshop, 2001