Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
Quasi-cyclic (QC) low-density parity-check (LDPC) codes are an important instance of proto-graph-based LDPC codes. In this paper… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2012
Highly Cited
2012
In his Tanner Lecture of 1979 called “Equality of What?” Amartya Sen asked what metric egalitarians should use to establish the… Expand
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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Abstract only: Today’s data analysts and modellers are in the luxurious position of being able to more closely describe… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Come with us to read a new book that is coming recently. Yeah, this is a new coming book that many people really want to read… Expand
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Preface Part I: The Key Ideas of Team-Based Learning 1, Beyond Small Groups - Harnessing the Extraordinary Power of Learning… Expand
  • figure 3
  • figure 1
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We propose a general method for constructing Tanner (1981) graphs with large girth by progressively establishing edges or… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2001
Highly Cited
2001
A new task goal elicits a feeling of pride in individuals with a subjective history of success, and this achievment pride… Expand
  • table 1
Is this relevant?
Highly Cited
1999
Highly Cited
1999
We build a class of pseudo-random error correcting codes, called generalized low density codes (GLD), from the intersection of… Expand
  • figure 3
  • figure 4
  • figure 5
  • figure 7
  • figure 6
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… Expand
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 2.1
  • figure 2.2
Is this relevant?