World Library  
Flag as Inappropriate
Email this Article

Maximum distance separable code

Article Id: WHEBN0019319583
Reproduction Date:

Title: Maximum distance separable code  
Author: World Heritage Encyclopedia
Language: English
Subject: Reed–Solomon error correction, MDS matrix
Collection:
Publisher: World Heritage Encyclopedia
Publication
Date:
 

Maximum distance separable code

In coding theory, the Singleton bound, named after Richard Collom Singleton, is a relatively crude bound on the size of a block code C with block length n, size r and minimum distance d.

Statement of the Bound

The minimum distance of a set C of codewords of length n is defined as

d = \min_{x,y \in C, x \neq y} d(x,y)

where d(x,y) is the Hamming distance between x and y. The expression A_{q}(n,d) represents the maximum number of possible codewords in a q-ary block code of length n and minimum distance d.

Then the Singleton bound states that

A_q(n,d) \leq q^{n-d+1}.

Proof

First observe that there are q^n many q-ary words of length n, since each letter in such a word may take one of q different values, independently of the remaining letters.

Now let C be an arbitrary q-ary block code of minimum distance d. Clearly, all codewords c \in C are distinct. If we delete the first d-1 letters of each codeword, then all resulting codewords must still be pairwise different, since all original codewords in C have Hamming distance at least d from each other. Thus the size of the code remains unchanged.

The newly obtained codewords each have length

n-(d-1)=n-d+1

and thus there can be at most

q^{n-d+1}

of them. Hence the original code C shares the same bound on its size |C|:

|C| \le A_q(n,d) \leq q^{n-d+1}.

MDS codes

Block codes that achieve equality in Singleton bound are called MDS (maximum distance separable) codes. Examples of such codes include codes that have only one codeword (minimum distance n), codes that use the whole of (F_{q})^{n} (minimum distance 1), codes with a single parity symbol (minimum distance 2) and their dual codes. These are often called trivial MDS codes.

In the case of binary alphabets, only trivial MDS codes exist.[1]

Examples of non-trivial MDS codes include Reed-Solomon codes and their extended versions.[2]

See also

Notes

References

Further reading

  • L. R. Vermani: Elements of algebraic coding theory, Chapman & Hall, 1996.
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
 
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
 
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.
 


Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.