2026 Pascal O. Vontobel: Computer Science Researcher – H-Index, Publications & Awards

Overview

Pascal O. Vontobel is affiliated with the Chinese University of Hong Kong in China. Their research contributions span mainly in the fields of Computer Science and Engineering, with subfields including Computational Theory and Mathematics, Computer Networks and Communications, Electrical and Electronic Engineering, Molecular Biology, and Artificial Intelligence.

The scientist's published work frequently addresses topics such as:

Error Correcting Code Techniques
Advanced Wireless Communication Techniques
DNA and Biological Computing
Matrix Theory and Algorithms
Advanced Graph Theory Research
Wireless Communication Security Techniques
Cooperative Communication and Network Coding

Pascal O. Vontobel's recent papers reflect a focus on theoretical and applied aspects of information theory, coding, and communications. Notable recent publications include:

Using List Decoding to Improve the Finite-Length Performance of Sparse Regression Codes, 2021, IEEE Transactions on Communications
Double-Cover-Based Analysis of the Bethe Permanent of Non-negative Matrices, 2022, 2022 IEEE Information Theory Workshop (ITW)
Degree-MBethe and Sinkhorn Permanent Based Bounds on the Permanent of a Non-Negative Matrix, 2024, IEEE Transactions on Information Theory
Constrained Secrecy Capacity of Finite-Input Intersymbol Interference Wiretap Channels, 2021, arXiv (Cornell University)
On the Relationship Between the Minimum of the Bethe Free Energy Function of a Factor Graph and Sum-Product Algorithm Fixed Points, 2022, 2022 IEEE Information Theory Workshop (ITW)

The scientist has collaborated frequently with colleagues including Haiwen Cao, Yu-Wen Huang, Reza Asvadi, Kit Shing NG, and Navin Kashyap.

Publications are concentrated in venues such as:

arXiv (Cornell University)
2022 IEEE Information Theory Workshop (ITW)
IEEE Transactions on Communications
IEEE Transactions on Information Theory

Best Publications

Simulation-Based Computation of Information Rates for Channels With Memory

D.M. Arnold;H.-A. Loeliger;P.O. Vontobel;A. Kavcic

621
Citations
Writing to and reading from a nano-scale crossbar memory based on memristors.

Pascal O Vontobel;Warren Robinett;Philip J Kuekes;Duncan R Stewart

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

Pascal O. Vontobel;Ralf Koetter

243
Citations
Deriving Good LDPC Convolutional Codes from LDPC Block Codes

A E Pusane;R Smarandache;P O Vontobel;Daniel J Costello

204
Citations
LDPC Codes for Compressed Sensing

A. G. Dimakis;R. Smarandache;P. O. Vontobel

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

Roxana Smarandache;Pascal O. Vontobel

145
Citations
A Generalization of the Blahut–Arimoto Algorithm to Finite-State Channels

P.O. Vontobel;A. Kavcic;D.M. Arnold;H.-A. Loeliger

128
Citations
Towards Low-Complexity Linear-Programming Decoding

Pascal O. Vontobel;Ralf Koetter

110
Citations
The Bethe Permanent of a Nonnegative Matrix

P. O. Vontobel

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

Pascal O. Vontobel

87
Citations
On the Relationship between Linear Programming Decoding and Min-Sum Algorithm Decoding

Pascal O. Vontobel;Ralf Koetter

82
Citations
Characterizations of pseudo-codewords of (low-density) parity-check codes

Ralf Koetter;Wen-Ching Winnie Li;Pascal O. Vontobel;Judy L. Walker

81
Citations
Partition Functions of Normal Factor Graphs

G. David Forney;Pascal O. Vontobel

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

P.O. Vontobel;D.M. Arnold

73
Citations
On Deriving Good LDPC Convolutional Codes from QC LDPC Block Codes

A.E. Pusane;R. Smarandache;P.O. Vontobel;D.J. Costello

70
Citations
Lower bounds on the minimum pseudoweight of linear codes

P.O. Vontobel;R. Koetter

69
Citations
Systems and methods for encoding information for storage in an electronic memory and for decoding encoded information retrieved from an electronic memory

Erik Ordentlich;Ron M. Roth;Pascal Vontobel

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

R. Smarandache;P.O. Vontobel

63
Citations
On low-complexity linear-programming decoding of LDPC codes

Pascal O. Vontobel;Ralf Koetter

61
Citations
The Bethe permanent of a non-negative matrix

Pascal O. Vontobel

59
Citations

Frequent Co-Authors

Ralf Koetter Technical University of Munich

Ron M. Roth Technion – Israel Institute of Technology

Daniel J. Costello University of Notre Dame

Alexandros G. Dimakis The University of Texas at Austin

Aleksandar Kavcic University of Hawaii at Manoa

Gadiel Seroussi University of the Republic

Jon Feldman Google (United States)

Philip J. Kuekes Hewlett-Packard (United States)

Henry D. Pfister Duke University

R. Stanley Williams Texas A&M University

External Links

Personal website of Pascal O. Vontobel

If you think any of the details on this page are incorrect, let us know.

Related Online Degrees & Career Pathways

Exploring Computer Science in the USA opens up diverse pathways beyond traditional degree programs. Many students and professionals start with online associates degrees, which offer a fast-track introduction to tech fundamentals and can often be completed in just two years.

For those seeking advanced qualifications, there is increasing interest in the fastest masters degree online programs. These accelerated courses allow you to obtain a valuable credential in as little as 12 months, helping you quickly advance your career in fields like data science, AI, and cybersecurity.

Investing in one of the most worthwhile masters degrees is an effective way to stand out in the competitive job market. These programs focus on in-demand tech disciplines designed for long-term career growth and innovation.

For those not ready to commit to a full degree, there are also easy certifications to get online. These credentials can quickly boost your resume and offer access to well-paying computer science roles.