Pascal O. Vontobel

From MaRDI portal
Revision as of 10:12, 6 October 2023 by Import231006081045 (talk | contribs) (Created automatically from import231006081045)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:540381

Available identifiers

zbMath Open vontobel.pascal-oMaRDI QIDQ540381

List of research outcomes





PublicationDate of PublicationType
Degree-\(M\) Bethe and Sinkhorn permanent based bounds on the permanent of a non-negative matrix2024-07-23Paper
Double-cover-based analysis of the Bethe permanent of non-negative matrices2022-05-30Paper
Quantum Measurement as Marginalization and Nested Quantum Systems2020-09-29Paper
Bounding and Estimating the Classical Information Rate of Quantum Channels With Memory2020-09-29Paper
A Factor-Graph Approach to Algebraic Topology, With Applications to Kramers–Wannier Duality2018-12-18Paper
Factor Graphs for Quantum Probabilities2017-11-10Paper
List Decoding of Burst Errors2017-08-08Paper
Optimization of Information Rate Upper and Lower Bounds for Channels With Memory2017-08-08Paper
Pseudocodeword Performance Analysis for LDPC Convolutional Codes2017-08-08Paper
Deriving Good LDPC Convolutional Codes from LDPC Block Codes2017-07-27Paper
LDPC Codes for Compressed Sensing2017-07-12Paper
Quasi-Cyclic LDPC Codes: Influence of Proto- and Tanner-Graph Structure on Minimum Hamming Distance Upper Bounds2017-07-12Paper
The Bethe Permanent of a Nonnegative Matrix2017-06-08Paper
Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function2017-06-08Paper
Coding for Combined Block–Symbol Error Correction2017-05-16Paper
Estimating the Information Rate of a Channel with Classical Input and Output and a Quantum State (Extended Version)2017-05-02Paper
https://portal.mardi4nfdi.de/entity/Q28308192016-10-31Paper
A Factor-Graph Representation of Probabilities in Quantum Mechanics2012-01-25Paper
On linear balancing sets2011-06-03Paper
A Generalization of the Blahut–Arimoto Algorithm to Finite-State Channels2009-02-24Paper
On the Existence of Universally Decodable Matrices2008-12-21Paper
Pseudo-Codeword Analysis of Tanner Graphs From Projective and Euclidean Planes2008-12-21Paper
On universally decodable matrices for space-time coding2007-09-20Paper
Characterizations of pseudo-codewords of (low-density) parity-check codes2007-06-22Paper
https://portal.mardi4nfdi.de/entity/Q44621392004-05-18Paper
Degree-$M$ Bethe and Sinkhorn Permanent Based Bounds on the Permanent of a Non-negative MatrixN/APaper

Research outcomes over time

This page was built for person: Pascal O. Vontobel