www.PseudoCodewords.info

Papers on Pseudo-Codewords

This page lists papers on pseudo-codewords. Note that the assignment of a paper to a certain category is not always clear-cut and sometimes arbitrary.

Any suggestions for additions to this page are highly welcome. Please send an email to Pascal Vontobel [email: firstname dot lastname at hp dot com]. Thank you!

2009

N. Axvig, D. Dreher, K. Morrison, E. Psota, L.C. Perez, and J.L. Walker
Analysis of connections between pseudocodewords [ieeexplore]
IEEE Trans. Inf. Theory, vol. 55, no. 9, pp. 4099-4107, Sept. 2009.

K. Chilappagari, M. Chertkov, M. Stepanov, and B. Vasic
Instanton-based techniques for analysis and reduction of error floors of LDPC codes [ieeexplore]
J. Sel. Areas in Comm., vol. 27, no. 6, pp. 855-865, Aug. 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.

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.

D. Dreher and J. Walker
Connections between computation trees and graph covers [ieeexplore]
Proc. Information Theory and Applications Workshop, UC San Diego, La Jolla, CA, USA, February 8-13, 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

S. Matsuda, S. Saito, and T. Hiramatsu
Computation of zeta functions counting pseudo-codewords of linear codes [ieeexplore]
Proc. Intern. Symp. Inform. Theory and its Appl., Auckland, New Zealand, Dec. 7-10, 2008.

N. Axvig, D. Dreher, K. Morrison, E. Psota, L.C. Pérez, and J. Walker
Towards universal cover decoding [pdf]
Proc. 2008 International Symposium on Information Theory and its Applications, Auckland, New Zealand; Dec. 2008.

M. Chertkov
Exactness of belief propagation for some graphical models with loops [IOP]
J. Stat. Mech., P10016, Oct. 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.

N. Axvig, D. Dreher, K. Morrison, E. Psota, L.C. Pérez, and J. Walker
Average min-sum decoding of LDPC codes [pdf]
Proc. 5th Intern. Symp. on Turbo Codes and Related Topics, Lausanne, Switzerland, Sept. 1-5, 2008.

M. Miwa, T. Wadayama, and I. Takumi
A cutting plane method based on redundant rows for improving fractional distance [arxiv]
Proc. 5th Intern. Symp. on Turbo Codes and Rel. Topics, Lausanne, Switzerland, Sept. 1-5, 2008.

V. Skachek and M.F. Flanagan
Lower bounds on the minimum pseudodistance for linear Codes with q-ary PSK modulation over AWGN [arxiv]
Proc. 5th International Symposium on Turbo Codes and Related Topics, Lausanne, Switzerland, September 1-5, 2008.

C.A. Kelley and J.L. Walker
LDPC codes from voltage graphs [ieeexplore]
Proc. IEEE Intern. Symp. Inform. Theory, Toronto, Canada, pp. 792-796, July 6-11, 2008.

N. Axvig, D. Dreher, K. Morrison, E. Psota, L.C. Pérez, and J. Walker
A universal theory of decoding and pseudocodewords [pdf]
SGER Technical report, July 2008.

M. Chertkov and M.G. Stepanov
An efficient pseudo-codeword search algorithm for linear programming decoding of LDPC codes [ieeexplore]
IEEE Transactions on Information Theory, vol. IT-54, no. 4, pp. 1514-1520, Apr. 2008.

S.-T. Xia and F.-W. Fu
Minimum pseudoweight and minimum pseudocodewords of LDPC codes [ieeexplore]
IEEE Transactions on Information Theory, vol. IT-54, no. 1, pp. 480-485, Jan. 2008.

2007

E. Mo and M.A. Arman
Design and performance of LDPC codes extended with parity-check symbols from a larger alphabet [ieeexplore]
Proc. IEEE Intern. Conf. on Information, Communications, and Signal Processing, Dec. 10-13., 2007

C. Kelley and D. Sridhara
Pseudocodewords of Tanner graphs [ieeexplore]
IEEE Trans. Inform. Theory, vol. 53, no. 11, pp. 4013-4038, Nov. 2007.

N. Axvig, D. Dreher, K. Morrison, E. Psota, L.C. Pérez, and J. Walker,
A universal theory of decoding and pseudocodewords [pdf]
Proc. 45th Annual Allerton Conference on Communication, Control, and Computing, Monticello, IL, USA, Sept. 25-28, 2007.

C.A. Kelley and D. Sridhara
On the pseudocodeword weight and parity-check matrix redundancy of linear codes [ieeexplore]
Proc. IEEE Information Theory Workshop, Lake Tahoe, CA, USA, Sept. 2007.

M. Chertkov
Reducing the error floor [ieeexplore]
Proc. Information Theory Workshop, Lake Tahoe, CA, USA, Sept. 2007.

C.A. Kelley and D. Sridhara
Eigenvalue bounds on the pseudo-codeword weight of expander codes [AIMsciences]
Adv. Math. Comm., vol. 1, no. 3, pp. 287-307, Aug. 2007.

E. Rosnes
On the effects of pseudo-codewords on independent rayleigh flat-fading channels [ieeexplore]
Proc. IEEE Information Theory Workshop, Bergen, Norway, July 2007.

R. Smarandache and P.O. Vontobel
Pseudo-codeword analysis of Tanner graphs from projective and Euclidean planes [ieeexplore]
IEEE Trans. Inform. Theory, vol. IT-53, no. 7, pp. 2376-2393, July 2007.

P.A. Regalia and J.M. Walsh
Optimality and duality of the turbo decoder [ieeexplore]
Proceedings of the IEEE, vol. 95, no. 6, pp. 1362-1377, Jun. 2007.

V.Y. Chernyak and M. Chertkov
Loop calculus and belief propagation for q-ary alphabet: loop tower [ieeexplore]
Proc. IEEE Intern. Symp. Inform. Theory, Nice, France, pp. 316-320, June 24-29, 2007.

M. Chertkov and M. Stepanov
Pseudo-codeword landscape [ieeexplore]
Proc. IEEE Intern. Symp. Inform. Theory, Nice, France, pp. 1546-1550, June 24-29, 2007.

C. Kelley, D. Sridhara, and J. Rosenthal,
Tree-based construction of LDPC codes having good pseudocodeword weights [ieeexplore]
IEEE Trans. Inform. Theory, vol. 53, no. 4, pp. 1460-1478, Apr. 2007.

M. Chertkov and M. Stepanov
Searching for low weight pseudo-codewords [arxiv]
Proc. ITA Workshop, San Diego, CA, USA, Jan./Feb. 2007.

2006

J.M. Walsh, P.A. Regalia, and C.R. Johnson, Jr.
Turbo decoding as iterative constrained maximum-likelihood sequence detection [ieeexplore]
IEEE Transactions on Information Theory, vol. IT-52, no. 12, pp. 5426--5437, Dec. 2006.

S.-T. Xia and F.-W. Fu
Minimum pseudo-codewords of LDPC codes [ieeexplore]
IEEE Inform. Theory Workshop, Chengdu, China, pp. 109-113, Oct. 2006.

M.G. Stepanov and M. Chertkov
Improving convergence of Belief Propagation decoding [arxiv]

C.A. Kelley, D. Sridhara, and J. Rosenthal
Pseudocodeword weights for non-binary LDPC codes [ieeexplore]
Proc. IEEE Intern. Symp. Inform. Theory, Seattle, WA, USA, pp. 1379-1383, July 9-14, 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, Seattle, WA, USA, pp. 1364 - 1368, July 9 - 14, 2006.

R. Koetter, W.-C. W. Li, P.O. Vontobel, and J.L. Walker
Characterizations of pseudo-codewords of LDPC codes [arxiv]
accepted (after revisions) for Advances in Mathematics, Aug. 2006.

S.-T. Xia and F.-W. Fu
On the stopping distance of finite geometry LDPC codes [ieeexplore]
IEEE Comm. Letters, vol. 10, no. 5, pp. 381-383, May 2006.

M. Chertkov and M.G. Stepanov
An efficient pseudo-codeword search algorithm for linear programming decoding of LDPC codes [arxiv]
www.arxiv.org, Jan. 2006.

2005

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, May 2007.

R. Smarandache and M. Wauer.
Bounds on the pseudo-weight of minimal pseudo-codewords of projective geometry codes [arxiv]
submitted, Oct. 2005.

D. Sridhara, C. Kelley, and J. Rosenthal
Tree-based construction of LDPC codes [ieeexplore]
Proc. IEEE Intern. Symp. on Inform. Theory, Adelaide, Australia, pp. 845-849, Sep. 4-9, 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.

D. Haley and A. Grant
Improved reversible LDPC codes [ieeexplore]
Proc. IEEE Intern. Symp. on Inform. Theory 2005, Adelaide, Australia, pp. 1367-1371, Sept. 4 - 9, 2005.

P. Chaichanavong and P. H. Siegel
Relaxation bounds on the minimum pseudo-weight of linear block codes [arxiv]
Proc. IEEE Intern. Symp. on Inform. Theory, Adelaide, Australia, pp. 805-809, September 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.

Z. Zhang
Study of permutation matrices based LDPC code construction [.pdf]
Project Report, UC Berkeley, 2005.

A. Gueye
Toward the weight enumerator function of pseudo-codewords [.pdf]
Project Report, UC Berkeley, 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.

C. Kelley and D. Sridhara
Structure of pseudocodewords in Tanner graphs [.pdf]
Proc. Intern. Symp. on Inform. Theory and its Appl. Oct. 10-13, 2004.

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.

C. Kelley, D. Sridhara, J. Xu, and J. Rosenthal
Pseudocodeword weights and stopping sets [ieeexplore]
Proc. IEEE Intern. Symp. on Inform. Theory, Chicago, IL, USA, p. 150, June 27 - July 3, 2004.

2003

T.D. Coleman
Pseudocodewords presentation [.pdf]
Technical Report, M.I.T., Cambridge, MA, USA, Sep. 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.

2001

G.D. Forney, Jr., R. Koetter, F.R. Kschischang, and A. Reznik
On the effective weights of pseudocodewords for codes defined on graphs with cycles [citeseer]
in Codes, Systems, and Graphical Models (B. Marcus and J. Rosenthal, eds.), vol. 123 of IMA Vol. Math. Appl., pp. 101-112, Springer Verlag, New York, Inc., 2001.

B. Frey, R. Koetter, and A. Vardy,
Signal-space characterization of iterative decoding [ieeexplore]
IEEE Trans. on Inform. Theory, vol. IT-47, no. 2, pp. 766-781, Feb 2001.

1999

G.A. Horn
Iterative Decoding and Pseudocodewords
PhD thesis, California Institute of Technology, Pasadena, CA, USA, 1999.

1998

S. Aji, G. Horn, R. McEliece, and M. Xu
Iterative Min-Sum Decoding of Tail-biting Codes [ieeexplore]
Proc. IEEE Inform. Theory Workshop, Killarny, Ireland, pp. 68-69, June 22-26, 1998.

1996

N. Wiberg
Codes and Decoding on General Graphs [.pdf]
Linköping Studies in Science and Technology, Ph.D thesis No. 440, Linköping, Sweden, 1996.

---

Last Modified: Tuesday, 15-Sep-2009 02:32:19 PDT