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.
2020
2020
Heterogeneous Computation Assignments in Coded Elastic Computing
We study the optimal design of a heterogeneous coded elastic computing (CEC) network where machines have varying relative… 
2020
2020
A Note on Self-Dual Generalized Reed-Solomon Codes
A linear code is called an MDS self-dual code if it is both an MDS code and a self-dual code with respect to the Euclidean inner… 
2013
2013
A lattice singleton bound
The binary coding theory and subspace codes for random network coding exhibit similar structures. The method used to obtain a… 
2013
2013
Enumerating Some Fractional Repetition Codes
In a distributed storage systems (DSS), regenerating codes are used to optimize bandwidth in the repair process of a failed node… 
2011
2011
An Efficient Rekeying Function Protocol with Multicast Key Distribution for Group Key Management in MANETs
Key management in the ad hoc network is a challenging issue concerning the security of the group communication. Group key… 
2010
2010
Efficiently Encodable Irregular QC-LDPC Codes Constructed from Self-Reciprocal Generator Polynomials of MDS Codes
This letter presents a class of quasi-cyclic (QC) low-density parity-check (LDPC) codes which are efficiently encodable and have… 
Highly Cited
2010
Highly Cited
2010
Distributed Data Storage with Minimum Storage Regenerating Codes - Exact and Functional Repair are Asymptotically Equally Efficient
We consider a set up where a file of size M is stored in n distributed storage nodes, using an (n,k) minimum storage regenerating… 
2008
2008
Generalized IRA Erasure Correcting Codes for Hybrid Iterative/Maximum Likelihood Decoding
The design of low-density parity-check (LDPC) codes under hybrid iterative / maximum likelihood decoding is addressed for the… 
2003
2003
A general encryption scheme based on MDS code
In this paper, we propose to combine cryptographically strong random key stream generators (including those used in stream… 
1991
1991
On the monotonic property of the probability of undetected error for a shortened code
The monotonic property of the probability of undetected error is considered when a shortened code of a linear code over GF(q) is… 
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)