| 2009 |
| 28 | EE | Arya Mazumdar,
Ron M. Roth,
Pascal O. Vontobel:
On linear balancing sets
CoRR abs/0901.3170: (2009) |
| 27 | EE | Roxana Smarandache,
Pascal O. Vontobel:
Quasi-Cyclic LDPC Codes: Influence of Proto- and Tanner-Graph Structure on Minimum Hamming Distance Upper Bounds
CoRR abs/0901.4129: (2009) |
| 26 | EE | Roxana Smarandache,
Pascal O. Vontobel:
Absdet-Pseudo-Codewords and Perm-Pseudo-Codewords: Definitions and Properties
CoRR abs/0904.2022: (2009) |
| 25 | EE | Parastoo Sadeghi,
Pascal O. Vontobel,
Ramtin Shams:
Optimization of Information Rate Upper and Lower Bounds for Channels With Memory.
IEEE Transactions on Information Theory 55(2): 663-688 (2009) |
| 2008 |
| 24 | EE | Pascal O. Vontobel:
Interior-Point Algorithms for Linear-Programming Decoding
CoRR abs/0802.1369: (2008) |
| 23 | EE | Pascal O. Vontobel:
Stabilizer Quantum Codes: A Unified View based on Forney-style Factor Graphs
CoRR abs/0807.3566: (2008) |
| 22 | EE | Ron M. Roth,
Pascal O. Vontobel:
List Decoding of Burst Errors
CoRR abs/0808.2837: (2008) |
| 21 | EE | Pascal O. Vontobel,
Aleksandar Kavcic,
Dieter-Michael Arnold,
Hans-Andrea Loeliger:
A Generalization of the Blahut-Arimoto Algorithm to Finite-State Channels.
IEEE Transactions on Information Theory 54(5): 1887-1918 (2008) |
| 2007 |
| 20 | EE | Parastoo Sadeghi,
Pascal O. Vontobel,
Ramtin Shams:
Optimization of Information Rate Upper and Lower Bounds for Channels with Memory
CoRR abs/0711.4406: (2007) |
| 19 | EE | Roxana Smarandache,
Pascal O. Vontobel:
Pseudo-Codeword Analysis of Tanner Graphs From Projective and Euclidean Planes.
IEEE Transactions on Information Theory 53(7): 2376-2393 (2007) |
| 18 | EE | Ashwin Ganesan,
Pascal O. Vontobel:
On the Existence of Universally Decodable Matrices.
IEEE Transactions on Information Theory 53(7): 2572-2575 (2007) |
| 2006 |
| 17 | EE | Ashwin Ganesan,
Pascal O. Vontobel:
On the Existence of Universally Decodable Matrices
CoRR abs/cs/0601066: (2006) |
| 16 | EE | Pascal O. Vontobel,
Ashwin Ganesan:
On Universally Decodable Matrices for Space-Time Coding
CoRR abs/cs/0601075: (2006) |
| 15 | EE | Ralf Koetter,
Pascal O. Vontobel:
On the Block Error Probability of LP Decoding of LDPC Codes
CoRR abs/cs/0602086: (2006) |
| 14 | EE | Pascal O. Vontobel,
Ralf Koetter:
Bounds on the Threshold of Linear Programming Decoding
CoRR abs/cs/0602087: (2006) |
| 13 | EE | Pascal O. Vontobel,
Ralf Koetter:
Towards Low-Complexity Linear-Programming Decoding
CoRR abs/cs/0602088: (2006) |
| 12 | EE | Roxana Smarandache,
Pascal O. Vontobel:
Pseudo-Codeword Analysis of Tanner Graphs from Projective and Euclidean Planes
CoRR abs/cs/0602089: (2006) |
| 11 | EE | Roxana Smarandache,
Ali Emre Pusane,
Pascal O. Vontobel,
Daniel J. Costello Jr.:
Pseudo-Codeword Performance Analysis for LDPC Convolutional Codes
CoRR abs/cs/0609148: (2006) |
| 10 | EE | Pascal O. Vontobel,
Ashwin Ganesan:
On universally decodable matrices for space-time coding.
Des. Codes Cryptography 41(3): 325-342 (2006) |
| 9 | EE | Dieter-Michael Arnold,
Hans-Andrea Loeliger,
Pascal O. Vontobel,
Aleksandar Kavcic,
W. Zeng:
Simulation-Based Computation of Information Rates for Channels With Memory.
IEEE Transactions on Information Theory 52(8): 3498-3508 (2006) |
| 2005 |
| 8 | EE | Ralf Koetter,
Wen-Ching W. Li,
Pascal O. Vontobel,
Judy L. Walker:
Pseudo-Codewords of Cycle Codes via Zeta Functions
CoRR abs/cs/0502033: (2005) |
| 7 | EE | Jon Feldman,
Ralf Koetter,
Pascal O. Vontobel:
The Benefit of Thresholding in LP Decoding of LDPC Codes
CoRR abs/cs/0508014: (2005) |
| 6 | EE | Pascal O. Vontobel,
Roxana Smarandache,
Negar Kiyavash,
Jason Teutsch,
Dejan Vukobratovic:
On the Minimal Pseudo-Codewords of Codes from Finite Geometries
CoRR abs/cs/0508019: (2005) |
| 5 | EE | Ralf Koetter,
Wen-Ching W. Li,
Pascal O. Vontobel,
Judy L. Walker:
Characterizations of Pseudo-Codewords of LDPC Codes
CoRR abs/cs/0508049: (2005) |
| 4 | EE | Pascal O. Vontobel,
Ashwin Ganesan:
An Explicit Construction of Universally Decodable Matrices
CoRR abs/cs/0508098: (2005) |
| 3 | EE | Pascal O. Vontobel,
Roxana Smarandache:
On Minimal Pseudo-Codewords of Tanner Graphs from Projective Planes
CoRR abs/cs/0510043: (2005) |
| 2 | EE | Pascal O. Vontobel,
Ralf Koetter:
Graph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of LDPC Codes
CoRR abs/cs/0512078: (2005) |
| 2004 |
| 1 | EE | Pascal O. Vontobel:
A Factor-Graph Approach to the Context-Tree Weighting Method.
Data Compression Conference 2004: 571 |