» PhD Thesis
»
Journal Papers and Book Chapters
» Conference Papers
» Technical Reports
» Talks
Alternatively:
»
Publications by topic
P.O. Vontobel
Algebraic Coding for Iterative Decoding
[.ps.gz]
Diss. ETH No. 14961, ETH Zurich, 2003.
Appeared also as
P.O. Vontobel
Algebraic Coding for Iterative Decoding
Hartung-Gorre Verlag,
Konstanz, ISSN 1616-671X, ISBN 3-89649-865-7, 2003.
Journal Papers and Book Chapters
|
Submitted
R.M. Roth and P.O. Vontobel
List decoding of burst errors
[arxiv]
submitted to IEEE Transactions on Information Theory, August 2008.
P. Sadeghi, P. O. Vontobel, and R. Shams
Optimization of information rate upper and lower bounds
for channels with memory
[arxiv]
submitted to IEEE Trans. Inform. Theory, 2007.
Accepted
R. Smarandache, A.E. Pusane, P.O. Vontobel, and
D.J. Costello, Jr.
Pseudo-codeword performance analysis for
LDPC convolutional codes
[arxiv]
accepted for IEEE Trans. on Inform. Theory, May 2007.
P.O. Vontobel and R. Koetter
Graph-cover decoding and finite-length analysis of
message-passing iterative decoding of LDPC codes
[arxiv]
accepted for IEEE Trans. on Inform. Theory, 2007.
In Preparation
P.O. Vontobel
A factor-graph approach to the context-tree weighting method
in preparation.
P.O. Vontobel
Representations and updating of Gaussian messages in factor graphs
[.ps]
[.ps.gz]
preprint, Apr. 2003.
2008
P.O. Vontobel, A. Kavcic, D. Arnold, and H.-A. Loeliger
A generalization of the Blahut-Arimoto algorithm to
finite-state channels
[ieeeXplore]
IEEE Trans. Inform. Theory, vol. IT-54, no. 5, pp. 1887--1918, May. 2008.
2007
P.O. Vontobel and R. Koetter
On low-complexity linear-programming decoding of LDPC codes
[Wiley InterScience]
Europ. Trans. on Telecomm., vol. 5, pp. 509-517, Aug. 2007.
R. Koetter, W.-C. W. Li, P.O. Vontobel, and J.L. Walker
Characterizations of pseudo-codewords of (low-density) parity-check codes
[ScienceDirect]
Advances in Mathematics, vol. 213, pp. 205-229, Aug. 2007.
A. Ganesan and P.O. Vontobel
On the existence of universally decodable matrices
[ieeeXplore]
IEEE Trans. on Inform. Theory, vol. IT-53, pp. 2572-2575, July 2007.
R. Smarandache and P.O. Vontobel
Pseudo-codeword analysis of Tanner graphs
from projective and Euclidean planes
[ieeeXplore]
IEEE Trans. on Inform. Theory, vol. IT-53, pp. 2376-2393, July 2007.
2006
P.O. Vontobel and A. Ganesan
On universally decodable matrices for space-time coding
[SpringerLink]
Des. Codes Cryptogr., vol. 41, pp. 325-342, Dec. 2006.
D. Arnold, H.-A. Loeliger, P.O. Vontobel,
A. Kavcic, and W. Zeng
Simulation-based computation of information rates
for channels with memory
[ieeeXplore]
IEEE Trans. Inform. Theory, vol. IT-52, no. 8, pp. 3498-3508, Aug. 2006.
2003
P.O. Vontobel and H.-A. Loeliger
On factor graphs and electrical networks
[.pdf]
Mathematical Systems Theory in Biology,
Communication, Computation, and Finance,
J. Rosenthal and D.S. Gilliam, eds.,
IMA Volumes in Math. & Appl., Springer Verlag, p. 469-492, 2003.
2008
P.O. Vontobel
Stabilizer quantum codes: a unified view based on Forney-style factor graphs
[arxiv]
Proc. 5th International Symposium on Turbo Codes and Related Topics,
Lausanne, Switzerland, Sept. 1-5, 2008.
R.M. Roth and P.O. Vontobel
List decoding of burst errors
[ieeexplore]
Proc. International Symposium on Information Theory, Toronto, Canada,
July 6-11, 2008, pp. 66-70.
P.O. Vontobel
Interior-point algorithms for linear-programming decoding
[arxiv]
Proc. Information Theory and its Applications Workshop, UC San Diego,
La Jolla, CA, USA, Jan./Feb., 2008.
2007
A.E. Pusane, R. Smarandache, P.O. Vontobel, and D.J. Costello, Jr.
On deriving good LDPC convolutional codes from QC LDPC block codes
[ieeexplore]
Proc. IEEE Intern. Symp. on Inform. Theory, Nice, France,
pp. 1221-1225, June 24-29, 2007.
P. Sadeghi, P. O. Vontobel, and R. Shams
Optimizing information rate bounds for channels with memory
[ieeexplore]
Proc. IEEE Intern. Symp. on Inform. Theory, Nice, France,
pp. 171-175, June 24-29, 2007.
A. Gamburd, M.-H. Kang, P.J. Kuekes, W.-C.W. Li, and P.O. Vontobel,
Expanders and self-assembled architectures
Proc. Foundations of Nanoscience, Snowbird, UT, USA, pp. 193-194,
Apr. 18-21, 2007.
2006
P.O. Vontobel
A factor-graph approach to universal decoding
[.pdf]
Proc. 44th Allerton Conf. on Communications, Control, and
Computing, Allerton House, Monticello, Illinois, USA,
Sep. 27-29, 2006.
R. Smarandache, A.E. Pusane, P.O. Vontobel, and
D.J. Costello, Jr.
Pseudo-codewords in LDPC convolutional codes
[.pdf]
Proc. IEEE Intern. Symp. on Inform. Theory 2006,
Seattle, WA, USA, pp. 1364 - 1368, July 9 - 14, 2006.
P.O. Vontobel and R. Koetter
Towards low-complexity linear-programming decoding
[arxiv]
Proc. 4th Intern. Conf. on Turbo Codes and Related Topics,
Munich, Germany, Apr. 3-7, 2006.
P.O. Vontobel and R. Koetter
Bounds on the threshold of linear programming decoding
[arxiv]
Proc. IEEE Inform. Theory Workshop, Punta Del Este, Uruguay,
Mar. 13-16, 2006.
R. Koetter and P.O. Vontobel
On the block error probability of LP decoding of LDPC codes
[arxiv]
Proc. Inaugural Workshop of the Center for
Information Theory and its Applications,
UCSD, La Jolla, CA, USA, Feb. 6-10, 2006.
P.O. Vontobel and A. Ganesan
On universally decodable matrices for space-time coding
[arxiv]
Proc. Inaugural Workshop of the Center for
Information Theory and its Applications,
UCSD, La Jolla, CA, USA, Feb. 6-10, 2006.
2005
P.O. Vontobel and R. Smarandache
On minimal pseudo-codewords of Tanner graphs
from projective planes
[arxiv]
Proc. 43rd Allerton Conf. on Communications, Control, and
Computing, Allerton House, Monticello, Illinois, USA,
Sept. 28-30, 2005.
J. Feldman, R. Koetter, and P.O. Vontobel
The benefit of thresholding in LP decoding of LDPC codes
[arxiv]
Proc. IEEE Intern. Symp. on Inform. Theory 2005,
Adelaide, Australia, pp. 307-311, Sept. 4 - 9, 2005.
P.O. Vontobel, R. Smarandache, N. Kiyavash, J. Teutsch, and
D. Vukobratovic
On the minimal pseudo-codewords of codes from finite geometries
[arxiv]
Proc. IEEE Intern. Symp. on Inform. Theory 2005,
Adelaide, Australia, pp. 980-984, Sept. 4 - 9, 2005.
2004
R. Koetter, W.-C. W. Li, P.O. Vontobel, and J.L. Walker
Pseudo-codewords of cycle codes via zeta functions
[arxiv]
Proc. IEEE Inform. Theory Workshop, San Antonio, TX, USA, pp. 6-12,
October 24-29, 2004.
P.O. Vontobel and R. Koetter
On the relationship between linear programming decoding
and min-sum algorithm decoding
[.pdf]
Proc. ISITA 2004, Parma, Italy, p. 991-996, October 10-13, 2004.
(A typo on page 1 has been corrected: "max-sum" -> "min-sum".)
P.O. Vontobel and R. Koetter
Lower bounds on the minimum pseudo-weight of linear codes,
Final version:
[.pdf]
Submitted version (with addtional details):
[.pdf]
Proc. IEEE Intern. Symp. Inform. Theory,
Chicago, IL, USA, p. 70, June 27 - July 2, 2004.
R. Smarandache and P.O. Vontobel
On regular quasi-cyclic LDPC codes from binomials
[.pdf]
Proc. IEEE Intern. Symp. Inform. Theory,
Chicago, IL, USA, p. 274, June 27 - July 2, 2004.
P.O. Vontobel
A factor-graph approach to the context-tree weighting method
[.ps]
Proc. Data Compression Conference 2004,
Snowbird, UT, USA, p. 571, March 23-25, 2004.
Slides of a talk at the U of U on that topic.
[.ps]
2003
R. Koetter and P.O. Vontobel
Graph covers and iterative decoding of finite-length codes
[.pdf]
Proc. 3rd International Symposium on Turbo Codes & Related Topics,
Brest, France, pp. 75-82, Sep. 1-5, 2003.
P.O. Vontobel
A generalized Blahut-Arimoto algorithm
[.ps]
[.ps.gz]
Proc. IEEE Intern. Symp. Inform. Theory,
Pacifico Yokohama, Japan, p. 53, June 29 - July 4, 2003.
D. Arnold, A. Kavcic, H.-A. Loeliger, P.O. Vontobel,
and W. Zeng
Simulation-based computation of information rates:
upper and lower bounds
[.pdf]
Proc. IEEE Intern. Symp. Inform. Theory,
Pacifico Yokohama, Japan, p. 119, June 29-July 4, 2003.
P.O. Vontobel and H.-A. Loeliger
Factor graphs and dynamical electrical networks
Conference version:
[.ps]
[.ps.gz]
Extended version:
[.ps]
[.ps.gz]
Proc. IEEE Information Theory Workshop,
Paris, France, March 30 - April 4, pp. 218-221, 2003.
2002
P.O. Vontobel
Factor graphs, electrical networks, and entropy
[.pdf]
Proc. 40th Allerton Conf. on Communications, Control, and
Computing, Allerton House, Monticello, Illinois, USA,
Oct. 2-4, 2002.
H.-A. Loeliger, D. Arnold, and P.O. Vontobel
Computation of information rates from finite state/source channel models
[.pdf]
Proc. 40th Allerton Conf. on Communications, Control, and
Computing, Allerton House, Monticello, Illinois, USA, Oct. 2-4, 2002.
P.O. Vontobel, D. Lippuner, and H.-A. Loeliger
Kalman filters, factor graphs, and electrical networks
[.pdf]
Proc. 15th Intern. Symp. on Math. Theory of Networks and Systems,
Notre Dame, IN, USA, Aug. 12-16, 2002.
P.O. Vontobel and H.-A. Loeliger
Irregular codes from regular graphs
[.ps]
Proc. IEEE Intern. Symp. Inform. Theory, Lausanne, Switzerland,
pp. 284, June 30-July 5, 2002.
P.O. Vontobel
On the construction of turbo code interleavers based on
graphs with large girth
[.pdf]
Proc. IEEE Intern. Conf. Communications,
New York, NY, USA, Vol. 3, pp. 1408-1412, Apr. 28 - May 2, 2002.
2001
P.O. Vontobel and D.M. Arnold
An upper bound on the capacity of channels with memory and constraint input
[.ps]
[.ps.gz]
Proc. IEEE Inform. Theory Workshop,
Cairns, Australia, pp. 147-149, Sept. 2-7, 2001.
P.O. Vontobel and R.M. Tanner
Construction of codes based on finite generalized quadrangles
for iterative decoding
[.ps]
[.ps.gz]
Proc. IEEE Intern. Symp. on Inform. Theory,
Washington, D.C., USA, p. 223, June 24--29, 2001.
J. Rosenthal and P.O. Vontobel
Construction of regular and irregular LDPC codes using
Ramanujan graphs and ideas from Margulis
[.ps]
[.ps.gz]
Proc. IEEE Intern. Symp. on Inform. Theory,
Washington, D.C., USA, p. 4, June 24-29, 2001.
2000
J. Rosenthal and P.O. Vontobel
Constructions of LDPC codes using Ramanujan graphs
and ideas from Margulis
[.pdf]
Proc. of the 38th Allerton Conference on Communication,
Control, and Computing, Monticello, Illinois, USA,
pp. 248-257, Oct. 4-6, 2000.
D. Arnold, A. Kavcic, R. Koetter, H.-A. Loeliger, and P.O. Vontobel
The binary jitter channel: a new model for magnetic recording
[.pdf]
Proc. IEEE Intern. Symp. on Inform. Theory,
Sorrento, Italy, p. 433, June 25-30, 2000.
H. Mathis and P.O. Vontobel
Shape optimization of a rectangularly constrained small loop antenna
[.pdf]
Proc. International Zurich Seminar,
Zurich, Switzerland, p. 73-76, Feb. 15-17, 2000.
P.O. Vontobel and A. Ganesan
An explicit construction of universally decodable matrices
[arxiv]
Technical Report, Aug. 2005.
P.O. Vontobel
A generalized Blahut-Arimoto algorithm
[.ps]
[.ps.gz]
ISI Internal Report, INT200203, 2002.
P.O. Vontobel
Kalman Filters, Factor Graphs, and Electrical Networks
[.pdf]
Post-Diploma Project at ETH Zurich, 2002.
P.O. Vontobel
Comments on the paper `Which codes have
cycle-free Tanner graphs' by T. Etzion,
A. Trachtenberg, and A. Vardy
unpublished, 1999.
R.M. Tonezzer and P.O. Vontobel
Exploring the Ziv-Lempel Algorithm
Diploma Project, ETH Zurich, 1997.
R.M. Tonezzer and P.O. Vontobel
Investigation of Dynamic Compressors for Hearing Aids
Semester Project, ETH Zurich, 1996.
R.M. Tonezzer and P.O. Vontobel
Signal Processing for Angle of Arrival Estimation
Semester Project, ETH Zurich, 1996.
Talks (besides paper presentations at conferences)
|
2008
»
Insights from Graph Covers Into Solving
Constrained Optimization
Problems and Minimizing Bethe Free Energy
Talk at the BIRS Workshop on
"Phase Transitions,
Hard Combinatorial Problems,
and Message Passing Algorithms"
in Banff, AB, Canada, June 9, 2007.
» At University of Zurich, Zurich, Switzerland,
February 27, 2008.
» At ETH Zurich, Zurich, Switzerland, February 25, 2008.
» At Technical University Munich, Munich, Germany, February 20.
» At Stanford University, Stanford, CA, USA, January 24, 2008.
2007
»
A factor-graph approach to universal channel decoding
Talk at the MFO Workshop on "Coding Theory",
Mathematisches Forschungsinstitute Oberwolfach, Germany,
December 4, 2007.
»
On the information rate of finite-state channels
[slides]
Talk at the BIRS Workshop on
"Entropy of Hidden Markov Processes
and Connections to Dynamical Systems"
in Banff, AB, Canada,
October 4, 2007.
»
Pseudo-codewords and iterative decoding: a guided tour
[slides]
Plenary talk at 2007 Information Theory Workshop
in Lake Tahoe, CA, USA,
Sep. 5, 2007.
» At University of Hawaii, Honolulu, HI, USA, May 4, 2007.
»
Beyond semi-rings: sum-product algorithm over rings
at AMS Spring 2007 Southeastern Section Meeting,
Davidson, NC, USA, Mar. 3, 2007.
2006
» At Los Alamos National Laboratory, NM, USA,
Dec. 11, 2006.
» At UC Berkeley, Berkeley, CA, USA,
Nov. 20, 2006.
»
Coding and optimization
Half-day seminar at the
University of Southern California,
Los Angeles, CA, USA,
Nov. 10, 2006.
» At Yale University, New Haven, CT, USA,
Apr. 19, 2006.
» At the University of Maryland, College Park, MD, USA,
Apr. 17, 2006.
»
Finding the best representation of a code
Open Problems Session at the Inaugural Workshop of the
Center for Information Theory and its Applications,
UC San Diego,
La Jolla, CA, USA, Feb. 8, 2006.
»
Graphical models, LP decoding, graph-cover decoding,
and algebraic constructions of LDPC codes
Six lectures at the Winter School for
graduate students on
"Mathematical Aspects of High Performance Codes"
at Centro De Giorgi,
University of Pisa, Pisa, Italy, Jan. 30 - Feb. 3, 2006.
2005
» At ETH Zurich, Zurich, Switzerland,
December 15, 2005.
» At University of Notre Dame, Notre Dame, IN, USA,
Sep. 26, 2005.
»
An explicit construction of universally decodable matrices
at AMS Fall 2005 Central Sectional Meeting, Lincoln, NE, USA,
Sep. 22, 2005.
» At University of Newcastle, Newcastle, Australia,
August 31, 2005.
» At Massachusetts Institute of Technology, Cambridge, MA, USA,
July 13, 2005.
» At UC Berkeley, Berkeley, CA, USA,
Feb. 16, 2005.
» At ETH Zurich, Zurich, Switzerland,
Jan. 13, 2005.
2004
» At University of California at San Diego,
San Diego, CA, USA,
August 4, 2004.
» At University of Notre Dame, Notre Dame, IN, USA,
June 14/15, 2004
(two talks).
» At University of Wisconsin-Madison, Madison, WI, USA,
April 21, 2004.
» At University of Utah, Salt Lake City, UT, USA,
Mar. 22, 2004.
2003
» At ETH Zurich, Zurich, Switzerland,
Dec. 23, 2003.
»
Graph-covers and iterative decoding of finite-length codes
at DIMACS Workshop
"Algebraic Coding Theory and Information Theory",
Piscataway, NJ, USA,
December 15-18, 2003.
»
Factor graphs and static/dynamical electrical networks
at the "Probability and Statistical Mechanics
in Information Science" Workshop
in Pisa, Italy, June 20, 2003.
» At University of Ulm, Germany, Jan. 7/8, 2003 (two talks).
2002
» At University of Notre Dame, IN, USA, Nov. 20, 2002.
»
Iterative decoding and design of codes on graphs
at 15th Intern. Symp. on Math. Theory of
Networks and Systems,
Notre Dame University, IN, USA,
Aug. 13, 2002.
»
Factor graphs, the sum-product algorithm,
LDPC code constructions, density evolution,
and Kalman filtering
Four lectures at San Diego State University,
San Diego, CA, USA,
May 3-14, 2002.
»
On the derivation of LDPC and turbo codes
from graphs with large girth,
at AMS and MAA Joint Mathematics Meeting,
San Diego, CA, USA,
Jan. 8, 2002.
2001
» At Forschungszentrum Telekommunikation Wien (FTW),
Vienna, Austria,
Dec. 17, 2001.
»
On algebraic code constructions for iterative decoding,
at DIMACS Workshop on Codes and Complexity,
Piscataway, NJ, USA,
Dec. 6, 2001.
» At Harvard University, Cambridge, MA, USA, Nov. 30, 2001.
» At University of Melbourne, Australia, Sept. 14, 2001.
» At University of Illinois at Urbana-Champaign (UIUC), IL, USA,
Aug. 13, 2001.
» At Bell Labs, Murray Hill, NJ, USA, July 2, 2001.
» At IBM Labs, Rueschlikon, Switzerland, June 20, 2001
(two talks).
2000
»
Using finite geometries for deriving codes
that can be
decoded iteratively,
at Winter School on Coding and Information Theory,
Reisensburg,
Guenzburg, Germany, Dec. 2000.
Last Modified: Friday, 22-Aug-2008 22:01:52 PDT
|  |
|
Printable version
