Sparse graph code

Known as: Sparse graph codes 
A Sparse graph code is a code which is represented by a sparse graph. Any linear code can be represented as a graph, where there are two sets of… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
In this paper, we consider the problem of multi-level group testing, where the goal is to recover a set of K defective items in a… (More)
  • table I
  • figure 1
  • figure 2
Is this relevant?
2012
2012
This paper deals with the design of low-rate sparse-graph codes, having a linear minimum distance d_{min} in the blocklength n… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
Highly Cited
2012
Highly Cited
2012
Constructing a good graph to represent data structures is critical for many important machine learning tasks such as clustering… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2011
Highly Cited
2011
In this article, we exploit the problem of annotating a large-scale image corpus by label propagation over noisily tagged web… (More)
  • figure 1
  • figure 2
  • table I
  • figure 3
  • table II
Is this relevant?
2010
2010
Sparse graph codes were first introduced by Gallager over 40 years ago. Over the last two decades, such codes have been the… (More)
  • figure 2-1
  • figure 2-2
  • figure 2-3
  • figure 2-4
  • figure 2-5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Identifying critical nodes in a graph is important to understand the structural characteristics and the connectivity properties… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2008
Highly Cited
2008
There are two main algorithmic approaches to sparse signal recovery: geometric and combinatorial. The geometric approach utilizes… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Sparse-graph codes appropriate for use in quantum error-correction are presented. Quantum error-correcting codes based on sparse… (More)
  • table 3
  • figure 4
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Evaluation of Gallager codes for low error tolerance, short block length and high rate applications. Sparse graph codes include… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1991
Highly Cited
1991
In this paper, we present an algorithm that constructs sparse evaluation graphs for forward or backward monotone data flow… (More)
  • figure 1
  • figure 2
  • figure 4
  • table 1
  • figure 5
Is this relevant?