Skip to search formSkip to main contentSkip to account menu

Expander code

In coding theory, expander codes form a class of error-correcting codes that are constructed from bipartite expander graphs.Along with Justesen codes… 
Wikipedia (opens in a new tab)

Related topics

Related topics

10 relations
Binary codeBlock codeCoding theoryDegree (graph theory)

Broader (1)

Error detection and correction

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Improving the Performance of Nested Lattice Codes Using Concatenation
A fundamental problem in coding theory is the design of an efficient coding scheme that achieves the capacity of the additive… 
2015
2015
Linear time , high-rate , list-recoverable codes from expander graphs
We show that expander codes, when properly instantiated, are high-rate list-recoverable codes with linear-time list recovery… 
2013
2013
Expander code: A scalable erasure-resilient code to keep up with data growth in distributed storage
To ensure high reliability and storage efficiency, erasure codes are preferred in storage systems. With the prevalent of… 
2010
2010
Error Prediction and Variable Selection via Unbalanced Expander Graphs
We investigate the high-dimensional regression problem using adjacency matrices of unbalanced expander graphs. In this frame, we… 
2006
2006
Cse 533: Error-correcting Codes 2 Existential Knowledge
Consider a bipartite graph G(L, R, E) where every vertex in L has degree d, |L| = n and |R| = m ≤ n. The graph G is said to be a… 
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)