Pascal O. Vontobel

PhD ETH Zurich, 2003

Publications (by publication type and year)

» PhD Thesis
» Journal Papers and Book Chapters
» Conference Papers
» Reports

Alternatively: Publications by topic

PhD Thesis

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

Accepted

R. Smarandache and P.O. Vontobel
Quasi-cyclic LDPC codes: influence of proto- and Tanner-graph structure on minimum Hamming distance upper bounds [arxiv]
submitted to IEEE Trans. on Inform. Theory, Jan. 2009.

In Revision

A.G. Dimakis, R. Smarandache, and P.O. Vontobel
LDPC codes for compressed sensing [arxiv]
submitted to IEEE Trans. on Inform. Theory, Dec. 2010.

P.O. Vontobel
Counting in graph covers: a combinatorial characterization of the Bethe entropy function [arxiv]
submitted to IEEE Trans. on Inform. Theory, Nov. 2010.

Submitted

P.O. Vontobel
The Bethe permanent of a non-negative matrix [arxiv]
submitted to IEEE Trans. on Inform. Theory, Jul. 2011.

In Preparation

P.O. Vontobel
A factor-graph-based random walk, and its relevance for LP decoding analysis and Bethe entropy characterization
in preparation, to be submitted to IEEE Trans. on Inform. Theory.

P.O. Vontobel
Connecting the Bethe entropy and the edge zeta function of a cycle code
in preparation, to be submitted to IEEE Trans. on Inform. Theory.

2011

A.E. Pusane, R. Smarandache, P.O. Vontobel, and D.J. Costello, Jr.
Deriving good LDPC convolutional codes from LDPC block codes [ieeexplore]
IEEE Trans. Inform. Theory, vol. IT-57, no. 2, pp. 835-857, Feb. 2011.

2010

A. Mazumdar, R.M. Roth, and P.O. Vontobel
On linear balancing sets [amc]
Adv. Math. Commn, vol. 4, no. 3, pp. 345-361, Aug. 2010.

2009

P.O. Vontobel, W.Robinett, P.J. Kuekes, D.R. Stewart, J.Straznicky, and R.S. Williams
Writing to and reading from a nano-scale crossbar memory based on memristors [IOP Nanotechnology]
Nanotechnology, vol. 20, no. 42, p. 425204, Oct. 2009.

R.M. Roth and P.O. Vontobel
List decoding of burst errors [ieeexplore]
IEEE Trans. on Inf. Theory, vol. 55, no. 9, pp. 4179-4190, Sep. 2009.

R. Smarandache, A.E. Pusane, P.O. Vontobel, and D.J. Costello, Jr.
Pseudocodeword performance analysis for LDPC convolutional codes [ieeexplore]
IEEE Trans. on Inf. Theory, vol. 55, no. 6, pp. 2577-2598, Jun. 2009.

P. Sadeghi, P. O. Vontobel, and R. Shams
Optimization of information rate upper and lower bounds for channels with memory [ieeeXplore]
IEEE Trans. Inform. Theory, vol. 55, pp. 663-688, Feb. 2009.

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.

Miscellaneous

P.O. Vontobel and R. Koetter
Graph-cover decoding and finite-length analysis of message-passing iterative decoding of LDPC codes [arxiv]
CoRR, Dec. 2005.

Drafts

P.O. Vontobel
Representations and updating of Gaussian messages in factor graphs [.ps] [.ps.gz]
draft, Apr. 2003.

Conference Papers

2011

P.O. Vontobel
A factor-graph approach to Lagrangian and Hamiltonian dynamics [ieee]
Proc. IEEE Int. Symp. Inf. Theory, St. Petersburg, Russia, Jul. 31 - Aug. 5, 2011, pp. 2183-2187.

A. Al-Bashabsheh, Y. Mao, and P.O. Vontobel
Normal factor graphs: A diagrammatic approach to linear algebra [ieee]
Proc. IEEE Int. Symp. Inf. Theory, St. Petersburg, Russia, Jul. 31 - Aug. 5, 2011, pp. 2178-2182.

E. Ordentlich, G. Ribeiro, R. M. Roth, G. Seroussi, and P. O. Vontobel
Coding for limiting current in memristor crossbar memories
Proc. 2nd Annual Non-Volatile Memories Workshop, UC San Diego, La Jolla, CA, USA, Mar. 6-8, 2011.

P.O. Vontobel
A combinatorial characterization of the Bethe and the Kikuchi partition functions [ieeexplore]
Proc. Information Theory and Applications Workshop, UC San Diego, La Jolla, CA, USA, Feb. 6-11, 2011.

G.D. Forney, Jr, and P.O. Vontobel
Partition functions of normal factor graphs [arxiv]
Proc. Information Theory and Applications Workshop, UC San Diego, La Jolla, CA, USA, Feb. 6-11, 2011.

2010

P.O. Vontobel
The Bethe permanent of a non-negative matrix [pdf]
Proc. 48th Allerton Conference on Communications, Control, and Computing, Allerton House, Monticello, IL, USA, Sep. 29-Oct. 1, 2010.

P.O. Vontobel
Connecting the Bethe entropy and the edge zeta function of a cycle code [ieeexplore]
Proc. IEEE Int. Symp. Inform. Theory, Austin, TX, pp. 704-708, June 13-18, 2010.

A.G. Dimakis, R. Smarandache, and P.O. Vontobel
Channel coding LP decoding and compressed sensing LP decoding: further connections [pdf]
Proc. 2010 International Zurich Seminar on Communications, Zurich, Switzerland, March 3-5, 2010.

P.O. Vontobel
A factor-graph-based random walk, and its relevance for LP decoding analysis and Bethe entropy characterization [ieeexplore] [.pdf with colors]
Proc. Information Theory and Applications Workshop, UC San Diego, La Jolla, CA, USA, Jan. 31 - Feb. 5, 2010.

2009

A.G. Dimakis and P.O. Vontobel
LP decoding meets LP decoding: a connection between channel coding and compressed sensing [arxiv]
Proc. of the 47th Allerton Conference on Communications, Control, and Computing, Allerton House, Monticello, Illinois, USA, Sep. 30 - Oct. 2, 2009.

A. Mazumdar, R.M. Roth, and P.O. Vontobel
On linear balancing sets [ieeexplore]
Proc. IEEE Int. Symp. Information Theory, Seoul, Korea, June 28-July 3, 2009.

R. Smarandache and P.O. Vontobel
Absdet-pseudo-codewords and perm-pseudo-codewords: definitions and properties [ieeexplore]
Proc. IEEE Int. Symp. Information Theory, Seoul, Korea, pp. 229-233, June 28-July 3, 2009.

P.O. Vontobel
A graph-dynamics interpretation of the sum-product algorithm [slides]
Proc. Information Theory and Applications Workshop, UC San Diego, La Jolla, CA, USA, Feb. 8-13 2009.

2008

P.O. Vontobel
Symbolwise graph-cover decoding: connecting sum-product algorithm decoding and Bethe free energy minimization
[ieeexplore] [slides]
Proc. 46th Allerton Conf. on Communications, Control, and Computing, Allerton House, Monticello, IL, USA, Sept. 23-26, 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.

Reports

Y. Be'ery, M. Chertkov, S. Ruzika, and P.O. Vontobel
Workshop report for Worshop at Tel Aviv University on "Linear Programming and Message-Passing Approaches to High-Density Parity-Check Codes and High-Density Graphical Models" [itsoc]
IEEE Information Theory Society Newsletter, vol. 60, no. 2, pp. 12-13, June 2010.

N. Kashyap, E. Soljanin, and P.O. Vontobel
Workshop report for BIRS Workshop on "Applications of Matroid Theory and Combinatorial Optimization to Information and Coding Theory" [itsoc]
IEEE Information Theory Society Newsletter, vol. 59, no. 4, pp. 22-24, Dec. 2009.

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.

---

Last Modified: Saturday, 12-Nov-2011 23:45:41 PST