Search the dblp DataBase
Pascal O. Vontobel :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Pascal O. Vontobel A Factor-Graph Approach to the Context-Tree Weighting Method. [Citation Graph (0, 0)][DBLP ] Data Compression Conference, 2004, pp:571- [Conf ] Pascal O. Vontobel , Ashwin Ganesan On universally decodable matrices for space-time coding. [Citation Graph (0, 0)][DBLP ] Des. Codes Cryptography, 2006, v:41, n:3, pp:325-342 [Journal ] Dieter-Michael Arnold , Hans-Andrea Loeliger , Pascal O. Vontobel , Aleksandar Kavcic , W. Zeng Simulation-Based Computation of Information Rates for Channels With Memory. [Citation Graph (0, 0)][DBLP ] IEEE Transactions on Information Theory, 2006, v:52, n:8, pp:3498-3508 [Journal ] Roxana Smarandache , Ali Emre Pusane , Pascal O. Vontobel , Daniel J. Costello Jr. Pseudo-Codeword Performance Analysis for LDPC Convolutional Codes [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Ashwin Ganesan , Pascal O. Vontobel On the Existence of Universally Decodable Matrices [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Pascal O. Vontobel , Ashwin Ganesan On Universally Decodable Matrices for Space-Time Coding [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Ralf Koetter , Pascal O. Vontobel On the Block Error Probability of LP Decoding of LDPC Codes [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Pascal O. Vontobel , Ralf Koetter Bounds on the Threshold of Linear Programming Decoding [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Pascal O. Vontobel , Ralf Koetter Towards Low-Complexity Linear-Programming Decoding [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Roxana Smarandache , Pascal O. Vontobel Pseudo-Codeword Analysis of Tanner Graphs from Projective and Euclidean Planes [Citation Graph (0, 0)][DBLP ] CoRR, 2006, v:0, n:, pp:- [Journal ] Ralf Koetter , Wen-Ching W. Li , Pascal O. Vontobel , Judy L. Walker Pseudo-Codewords of Cycle Codes via Zeta Functions [Citation Graph (0, 0)][DBLP ] CoRR, 2005, v:0, n:, pp:- [Journal ] The Benefit of Thresholding in LP Decoding of LDPC Codes [Citation Graph (, )][DBLP ] On the Minimal Pseudo-Codewords of Codes from Finite Geometries [Citation Graph (, )][DBLP ] Characterizations of Pseudo-Codewords of LDPC Codes [Citation Graph (, )][DBLP ] An Explicit Construction of Universally Decodable Matrices [Citation Graph (, )][DBLP ] On Minimal Pseudo-Codewords of Tanner Graphs from Projective Planes [Citation Graph (, )][DBLP ] Graph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of LDPC Codes [Citation Graph (, )][DBLP ] Optimization of Information Rate Upper and Lower Bounds for Channels with Memory [Citation Graph (, )][DBLP ] Interior-Point Algorithms for Linear-Programming Decoding [Citation Graph (, )][DBLP ] Stabilizer Quantum Codes: A Unified View based on Forney-style Factor Graphs [Citation Graph (, )][DBLP ] List Decoding of Burst Errors [Citation Graph (, )][DBLP ] On linear balancing sets [Citation Graph (, )][DBLP ] Quasi-Cyclic LDPC Codes: Influence of Proto- and Tanner-Graph Structure on Minimum Hamming Distance Upper Bounds [Citation Graph (, )][DBLP ] Absdet-Pseudo-Codewords and Perm-Pseudo-Codewords: Definitions and Properties [Citation Graph (, )][DBLP ] LP Decoding meets LP Decoding: A Connection between Channel Coding and Compressed Sensing [Citation Graph (, )][DBLP ] Deriving Good LDPC Convolutional Codes from LDPC Block Codes [Citation Graph (, )][DBLP ] Search in 0.002secs, Finished in 0.002secs