In coding theory, a Tanner graph, named after Michael Tanner, is a bipartite graph used to state constraints or equations which specify errorâ€¦Â (More)

(More)

Semantic Scholar uses AI to extract papers important to this topic.

2010

2010

- Ruiqin Xiong, Wen Gao
- 2010 Data Compression Conference
- 2010

This paper interprets image interpolation as a channel decoding problem and proposes a tanner graph based interpolation frameworkâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- Milos Ivkovic, Shashi Kiran Chilappagari, Bane V. Vasic
- IEEE Transactions on Information Theory
- 2008

We discuss error floor asympotics and present a method for improving the performance of low-density parity-check (LDPC) codes inâ€¦Â (More)

Is this relevant?

Highly Cited

2007

Highly Cited

2007

- Christine A. Kelley, Deepak Sridhara
- IEEE Transactions on Information Theory
- 2007

This paper presents a detailed analysis of pseudocodewords of Tanner graphs. Pseudocodewords arising on the iterative decoder'sâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Xiao-Yu Hu, Evangelos Eleftheriou, Dieter-Michael Arnold
- IEEE Transactions on Information Theory
- 2005

We propose a general method for constructing Tanner graphs having a large girth by establishing edges or connections betweenâ€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

We propose a joint network-channel coding scheme for the multiple-access relay channel. In this scenario, two users use a commonâ€¦Â (More)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Xiao-Yu Hu, Evangelos Eleftheriou
- 2004 IEEE International Conference onâ€¦
- 2004

We derive the average symbol and Hamming weight spectrum functions of the random ensemble of regular low-density parity-checkâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- Xiao-Yu Hu, Evangelos Eleftheriou, Dieter-Michael Arnold
- GLOBECOM
- 2001

We propose a general method for constructing Tanner graphs with large girth by progressively establishing edges or connectionsâ€¦Â (More)

Is this relevant?

Highly Cited

2001

Highly Cited

2001

- G. David Forney
- IEEE Trans. Information Theory
- 2001

A generalized state realization of the Wiberg type is called normal if symbol variables have degree 1 and state variables haveâ€¦Â (More)

Is this relevant?

Highly Cited

1999

Highly Cited

1999

- Tuvi Etzion, Ari Trachtenberg, Alexander Vardy
- IEEE Trans. Information Theory
- 1999

If a linear block code C of length n has a Tanner graph without cycles, then maximum-likelihood soft-decision decoding of C canâ€¦Â (More)

Is this relevant?

Highly Cited

1996

Highly Cited

1996

- Niclas Wiberg
- 1996

Iterative decoding techniques have become a viable alternative for constructing high performance coding systems. In particularâ€¦Â (More)

Is this relevant?