Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Singleton bound
open-in-new
<p>In <a href="/facts/Coding_theory/SBqStoGL">coding theory</a>, the Singleton bound, named after the American mathematician Richard Collom Singleton (1928–2007), is a relatively crude upper bound on the size of an arbitrary <a href="/facts/Block_code/QVuqpGga">block code</a> C {\displaystyle C} with block length n {\displaystyle n} , size M {\displaystyle M} and minimum distance d {\displaystyle d} . It is also known as the Joshibound proved by Joshi (1958) and even earlier by Komamiya (1953). </p>