Pascal O. Vontobel
Pascal O. Vontobel
Associate Professor, The Chinese University of Hong Kong
Verified email at ieee.org - Homepage
TitleCited byYear
Simulation-based computation of information rates for channels with memory
DM Arnold, HA Loeliger, PO Vontobel, A Kavcic, W Zeng
IEEE Transactions on information theory 52 (8), 3498-3508, 2006
4722006
Writing to and reading from a nano-scale crossbar memory based on memristors
PO Vontobel, W Robinett, PJ Kuekes, DR Stewart, J Straznicky, ...
Nanotechnology 20 (42), 425204, 2009
2452009
Graph-covers and iterative decoding of finite length codes
R Koetter, PO Vontobel
Proc. 3rd Intern. Symp. on Turbo Codes and Related Topics, 1-5, 2003
2232003
Graph-cover decoding and finite-length analysis of message-passing iterative decoding of LDPC codes
PO Vontobel, R Koetter
arXiv preprint cs/0512078, 2005
1942005
Constructions of LDPC codes using Ramanujan graphs and ideas from Margulis
J Rosenthal, PO Vontobel
in Proc. of the 38-th Allerton Conference on Communication, Control, and …, 2000
1702000
On deriving good LDPC convolutional codes from QC LDPC block codes
AE Pusane, R Smarandache, PO Vontobel, DJ Costello
Information Theory, 2007. ISIT 2007. IEEE International Symposium on, 1221-1225, 2007
161*2007
LDPC Codes for Compressed Sensing
AG Dimakis, R Smarandache, PO Vontobel
Information Theory, IEEE Transactions on 58 (5), 3093-3114, 2012
1302012
Quasi-cyclic LDPC codes: Influence of proto-and Tanner-graph structure on minimum Hamming distance upper bounds
R Smarandache, PO Vontobel
IEEE Transactions on Information Theory 58 (2), 585-607, 2012
1152012
A generalization of the Blahut–Arimoto algorithm to finite-state channels
PO Vontobel, A Kavcic, DM Arnold, HA Loeliger
IEEE Transactions on Information Theory 54 (5), 1887-1918, 2008
942008
Towards low-complexity linear-programming decoding
PO Vontobel, R Koetter
4th International Symposium on Turbo Codes & Related Topics; 6th …, 2006
822006
The Bethe permanent of a nonnegative matrix
PO Vontobel
IEEE Transactions on Information Theory 59 (3), 1866-1901, 2012
762012
Characterizations of pseudo-codewords of (low-density) parity-check codes
R Koetter, WCW Li, PO Vontobel, JL Walker
Advances in Mathematics 213 (1), 205-229, 2007
712007
On the relationship between linear programming decoding and min-sum algorithm decoding
P Vontobel, R Koetter
702004
Counting in graph covers: A combinatorial characterization of the Bethe entropy function
PO Vontobel
IEEE Transactions on Information Theory 59 (9), 6018-6048, 2013
652013
An upper bound on the capacity of channels with memory and constraint input
PO Vontobel, DM Arnold
Proceedings 2001 IEEE Information Theory Workshop (Cat. No. 01EX494), 147-149, 2001
642001
Systems and methods for encoding information for storage in an electronic memory and for decoding encoded information retrieved from an electronic memory
E Ordentlich, RM Roth, P Vontobel
US Patent 8,407,560, 2013
572013
Lower bounds on the minimum pseudoweight of linear codes
PO Vontobel, R Koetter
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., 70, 2004
572004
Pseudo-codeword analysis of Tanner graphs from projective and Euclidean planes
R Smarandache, PO Vontobel
IEEE Transactions on Information Theory 53 (7), 2376-2393, 2007
552007
Constructions of regular and irregular LDPC codes using Ramanujan graphs and ideas from Margulis
J Rosenthal, PO Vontobel
Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE …, 2001
532001
On regular quasicyclic LDPC codes from binomials
R Smarandache, PO Vontobel
International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings., 274, 2004
512004
The system can't perform the operation now. Try again later.
Articles 1–20