The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Pascal O. Vontobel: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. 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]
  3. 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]
  4. 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]
  5. Ashwin Ganesan, Pascal O. Vontobel
    On the Existence of Universally Decodable Matrices [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  6. 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]
  7. 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]
  8. 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]
  9. Pascal O. Vontobel, Ralf Koetter
    Towards Low-Complexity Linear-Programming Decoding [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  10. 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]
  11. 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]

  12. The Benefit of Thresholding in LP Decoding of LDPC Codes [Citation Graph (, )][DBLP]


  13. On the Minimal Pseudo-Codewords of Codes from Finite Geometries [Citation Graph (, )][DBLP]


  14. Characterizations of Pseudo-Codewords of LDPC Codes [Citation Graph (, )][DBLP]


  15. An Explicit Construction of Universally Decodable Matrices [Citation Graph (, )][DBLP]


  16. On Minimal Pseudo-Codewords of Tanner Graphs from Projective Planes [Citation Graph (, )][DBLP]


  17. Graph-Cover Decoding and Finite-Length Analysis of Message-Passing Iterative Decoding of LDPC Codes [Citation Graph (, )][DBLP]


  18. Optimization of Information Rate Upper and Lower Bounds for Channels with Memory [Citation Graph (, )][DBLP]


  19. Interior-Point Algorithms for Linear-Programming Decoding [Citation Graph (, )][DBLP]


  20. Stabilizer Quantum Codes: A Unified View based on Forney-style Factor Graphs [Citation Graph (, )][DBLP]


  21. List Decoding of Burst Errors [Citation Graph (, )][DBLP]


  22. On linear balancing sets [Citation Graph (, )][DBLP]


  23. Quasi-Cyclic LDPC Codes: Influence of Proto- and Tanner-Graph Structure on Minimum Hamming Distance Upper Bounds [Citation Graph (, )][DBLP]


  24. Absdet-Pseudo-Codewords and Perm-Pseudo-Codewords: Definitions and Properties [Citation Graph (, )][DBLP]


  25. LP Decoding meets LP Decoding: A Connection between Channel Coding and Compressed Sensing [Citation Graph (, )][DBLP]


  26. Deriving Good LDPC Convolutional Codes from LDPC Block Codes [Citation Graph (, )][DBLP]


Search in 0.050secs, Finished in 0.051secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002