Graph-covers and iterative decoding of finite length codes

@inproceedings{Koetter2003GraphcoversAI,
  title={Graph-covers and iterative decoding of finite length codes},
  author={Ralf Koetter and Pascal O. Vontobel},
  year={2003}
}
Codewords in finite covers of a Tanner graph G are characterized. Since iterative, locally operating decoding algorithms cannot distinguish the underlying graph G from any covering graph, these codewords, dubbed pseudo-codewords are directly responible for sub-optimal behavior of iterative decoding algorithms. We give a simple characterization of pseudocodewords from finite covers and show that, for the additive, white Gaussian noise channel, their impact is captured in a finite set of “minimal… CONTINUE READING
Highly Influential
This paper has highly influenced 33 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 302 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 163 extracted citations

Pseudocodewords of Tanner Graphs

IEEE Transactions on Information Theory • 2007
View 10 Excerpts
Highly Influenced

On the minimum pseudo-codewords of LDPC codes

IEEE Communications Letters • 2006
View 8 Excerpts
Highly Influenced

Finite-length analysis of turbo decoding on the binary erasure channel

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. • 2005
View 12 Excerpts
Highly Influenced

Relaxation bounds on the minimum pseudo-weight of linear block codes

Proceedings. International Symposium on Information Theory, 2005. ISIT 2005. • 2005
View 9 Excerpts
Highly Influenced

302 Citations

02040'03'06'10'14'18
Citations per Year
Semantic Scholar estimates that this publication has 302 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 10 references

Factor graphs and the sum-product algorithm

IEEE Trans. Information Theory • 2001
View 5 Excerpts
Highly Influenced

On the effective weights of pseudocodewords for codes defined on graphs with cycles

G. D. Forney, Jr., R. Koetter, F. Kschischang, A. Reznik
Codes, systems, and graphical models (Minneapolis, MN, 1999), vol. 123 of IMA Vol. Math. Appl., pp. 101–112, New York: Springer, 2001. • 1999
View 5 Excerpts
Highly Influenced

Graph-covers and iterative decoding of finite length codes

R. Koetter, P. O. Vontobel
preparation, 2003 • 2003
View 1 Excerpt

McEliece The Generalized Distributive Law

R.J.S.M. Aji
IEEE Trans. Inform. Theory, • 2000
View 1 Excerpt

A recursive approach to low complexity codes

IEEE Trans. Information Theory • 1981
View 1 Excerpt

Similar Papers

Loading similar papers…