Tanner graph

Known as: Tanner 
In coding theory, a Tanner graph, named after Michael Tanner, is a bipartite graph used to state constraints or equations which specify error… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1956-2017
05010015019562016

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
This paper interprets image interpolation as a channel decoding problem and proposes a tanner graph based interpolation framework… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We discuss error floor asympotics and present a method for improving the performance of low-density parity-check (LDPC) codes in… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2007
Highly Cited
2007
This paper presents a detailed analysis of pseudocodewords of Tanner graphs. Pseudocodewords arising on the iterative decoder's… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We propose a general method for constructing Tanner graphs having a large girth by establishing edges or connections between… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
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)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We derive the average symbol and Hamming weight spectrum functions of the random ensemble of regular low-density parity-check… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We propose a general method for constructing Tanner graphs with large girth by progressively establishing edges or connections… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
A generalized state realization of the Wiberg type is called normal if symbol variables have degree 1 and state variables have… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 9
Is this relevant?
Highly Cited
1999
Highly Cited
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)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Iterative decoding techniques have become a viable alternative for constructing high performance coding systems. In particular… (More)
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 2.1
  • figure 2.2
Is this relevant?