Singleton bound
Upper bound in coding theory / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Maximum distance separable code?
Summarize this article for a 10 year old
SHOW ALL QUESTIONS
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 with block length , size and minimum distance . It is also known as the Joshibound.[1] proved by Joshi (1958) and even earlier by Komamiya (1953).