Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

7 relations
CodeError floorForward error correctionLinear code

Broader (1)

Error detection and correction

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Robust interactive image segmentation via graph-based manifold ranking
Interactive image segmentation aims at classifying the image pixels into foreground and background classes given some foreground… 
2015
2015
Novel routing algorithms in space information networks based on timeliness-aware data mining and time-space graph
Space information network is a kind of delay-tolerant networks. Recently, with possible participation of many network nodes… 
2015
2015
Clique-width and tree-width of sparse graphs
Tree-width and clique-width are two important graph complexity measures that serve as parameters in many xed-parameter tractable… 
2014
2014
Manifold-preserving graph reduction for sparse semi-supervised learning
2011
2011
Robotic Object Detection: Learning to Improve the Classifiers Using Sparse Graphs for Path Planning
Object detection is a basic skill for a robot to perform tasks in human environments. In order to build a good object classifier… 
2011
2011
Achieving AWGN Channel Capacity with Sparse Graph Modulation and "In the Air" Coupling
Communication over a multiple access channel is considered. Each user modulates his signal as a superposition of redundant data… 
2011
2011
Distributed stochastic pricing for sum-rate maximization in femtocell networks with random graph and quantized communications
In this paper, we consider a pricing mechanism aimed at maximizing the sum-rate of a femtocell network in a distributed manner… 
2007
2007
Sparse Graph Codes for Side Information and Binning
The pioneering work of Shannon provides fundamental bounds on the rate limitations of communicating information reliably over… 
2007
2007
Identifying stochastic basin hopping by partitioning with graph modularity
2003
2003
Small Worlds of Concepts and Other Principles of Semantic Search
A combination of the strengths of both classic information retrieval with the distributed approach of P2P networks can avoid both… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)