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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
We characterize product-maximum distance separable (PMDS) pairs of linear codes, i.e., pairs of codes C and D whose product under… (More)
Is this relevant?
2015
2015
In this paper, we will employ the technique used in the proof of classical Singleton bound to derive upper bounds for rank metric… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
2014
2014
  • Or Meir
  • Electronic Colloquium on Computational Complexity
  • 2014
Locally-correctable codes (LCCs) and locally-testable codes (LTCs) are codes that admit local algorithms for decoding and testing… (More)
Is this relevant?
2013
2013
The binary coding theory and subspace codes for random network coding exhibit similar structures. The method used to obtain a… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2012
2012
Subspace codes and rank-metric codes can be used to correct errors and erasures in network, with linear network coding. Both… (More)
Is this relevant?
2012
2012
We consider Reed-Solomon (RS) codes whose evaluation points belong to a subfield, and give a linear-algebraic list decoding… (More)
  • figure 1
Is this relevant?
2008
2008
Subsystem codes are a generalization of noiseless subsystems, decoherence-free subspaces and stabilizer codes. We generalize the… (More)
Is this relevant?
2007
2007
We give an algorithm for constructing linear network error-correcting codes that achieve the Singleton bound for network error… (More)
Is this relevant?
2007
2007
In this paper, we present a refined version of the Singleton bound for network error correction, and propose an algorithm for… (More)
  • figure 1
Is this relevant?
Highly Cited
2006
Highly Cited
2006
In the past few years, all manner of storage applications, ranging from disk array systems to distributed and wide-area systems… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 4
Is this relevant?