Skip to search formSkip to main contentSkip to account menu

Singleton bound

Known as: Singleton, MDS code, MDS 
In coding theory, the Singleton bound, named after Richard Collom Singleton, is a relatively crude upper bound on the size of an arbitrary block code… 
Wikipedia (opens in a new tab)

Related topics

Related topics

19 relations
Block codeCoding theoryConcatenated error correction codeCyclic code

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
Synchronization strings: codes for insertions and deletions approaching the Singleton bound
We introduce synchronization strings, which provide a novel way of efficiently dealing with synchronization errors, i.e… 
Highly Cited
2016
Highly Cited
2016
Private Information Retrieval From MDS Coded Data in Distributed Storage Systems
The problem of providing privacy, in the private information retrieval (PIR) sense, to users requesting data from a distributed… 
Highly Cited
2016
Highly Cited
2016
Explicit Constructions of High-Rate MDS Array Codes With Optimal Repair Bandwidth
Maximum distance separable (MDS) codes are optimal error-correcting codes in the sense that they provide the maximum failure… 
Highly Cited
2013
Highly Cited
2013
List decoding reed-solomon, algebraic-geometric, and gabidulin subcodes up to the singleton bound
We consider Reed-Solomon (RS) codes whose evaluation points belong to a subfield, and give a linear-algebraic list decoding… 
Highly Cited
2013
Highly Cited
2013
Local graph coloring and index coding
We present a novel upper bound for the optimal index coding rate. Our bound uses a graph theoretic quantity called the local… 
Highly Cited
2011
Highly Cited
2011
Zigzag Codes: MDS Array Codes With Optimal Rebuilding
Maximum distance separable (MDS) array codes are widely used in storage systems to protect data against erasures. We address the… 
Highly Cited
2011
Highly Cited
2011
Exact-Repair MDS Code Construction Using Interference Alignment
The high repair cost of (n, k) Maximum Distance Separable (MDS) erasure codes has recently motivated a new class of MDS codes… 
Highly Cited
2011
Highly Cited
2011
MDS array codes with optimal rebuilding
MDS array codes are widely used in storage systems to protect data against erasures. We address the rebuilding ratio problem… 
Highly Cited
2011
Highly Cited
2011
On codes for optimal rebuilding access
MDS (maximum distance separable) array codes are widely used in storage systems due to their computationally efficient encoding… 
Highly Cited
2010
Highly Cited
2010
Fractional repetition codes for repair in distributed storage systems
We introduce a new class of exact Minimum-Bandwidth Regenerating (MBR) codes for distributed storage systems, characterized by 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)