Singleton bound

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 ${\displaystyle C}$ with block length ${\displaystyle n}$, size ${\displaystyle M}$ and minimum distance ${\displaystyle d}$. It is also known as the Joshibound.^[1] proved by Joshi (1958) and even earlier by Komamiya (1953).