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).

Statement of the bound[]

The minimum distance of a set ${\displaystyle C}$ of codewords of length ${\displaystyle n}$ is defined as

${\displaystyle d=\min _{\{x,y\in C:x\neq y\}}d(x,y)}$

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

Then the Singleton bound states that

${\displaystyle A_{q}(n,d)\leq q^{n-d+1}.}$

Proof[]

First observe that the number of ${\displaystyle q}$-ary words of length ${\displaystyle n}$ is ${\displaystyle q^{n}}$, since each letter in such a word may take one of ${\displaystyle q}$ different values, independently of the remaining letters.

Now let ${\displaystyle C}$ be an arbitrary ${\displaystyle q}$-ary block code of minimum distance ${\displaystyle d}$. Clearly, all codewords ${\displaystyle c\in C}$ are distinct. If we puncture the code by deleting the first ${\displaystyle d-1}$ letters of each codeword, then all resulting codewords must still be pairwise different, since all of the original codewords in ${\displaystyle C}$ have Hamming distance at least ${\displaystyle d}$ from each other. Thus the size of the altered code is the same as the original code.

The newly obtained codewords each have length

${\displaystyle n-(d-1)=n-d+1}$,

and thus, there can be at most ${\displaystyle q^{n-d+1}}$ of them. Since ${\displaystyle C}$ was arbitrary, this bound must hold for the largest possible code with these parameters, thus:^[2]

${\displaystyle |C|\leq A_{q}(n,d)\leq q^{n-d+1}.}$

Linear codes[]

If ${\displaystyle C}$ is a linear code with block length ${\displaystyle n}$, dimension ${\displaystyle k}$ and minimum distance ${\displaystyle d}$ over the finite field with ${\displaystyle q}$ elements, then the maximum number of codewords is ${\displaystyle q^{k}}$ and the Singleton bound implies:

${\displaystyle q^{k}\leq q^{n-d+1}}$,

so that

${\displaystyle k\leq n-d+1}$,

which is usually written as^[3]

${\displaystyle d\leq n-k+1}$.

In the linear code case a different proof of the Singleton bound can be obtained by observing that rank of the parity check matrix is ${\displaystyle n-k}$.^[4] Another simple proof follows from observing that the rows of any generator matrix in standard form have weight at most ${\displaystyle n-k+1}$.

History[]

The usual citation given for this result is Singleton (1964), but was proven earlier by Joshi (1958). According to Welsh (1988, p. 72) the result can be found in a 1953 paper of Komamiya (1953)

MDS codes[]

Linear block codes that achieve equality in the Singleton bound are called MDS (maximum distance separable) codes. Examples of such codes include codes that have only two codewords (the all-zero word and the all-one word, having thus minimum distance ${\displaystyle n}$), codes that use the whole of ${\displaystyle (\mathbb {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.^[5][6]

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

MDS codes are an important class of block codes since, for a fixed ${\displaystyle n}$ and ${\displaystyle k}$, they have the greatest error correcting and detecting capabilities. There are several ways to characterize MDS codes:^[9]

Theorem: Let ${\displaystyle C}$ be a linear [${\displaystyle n,k,d}$] code over ${\displaystyle \mathbb {F} _{q}}$. The following are equivalent:

• ${\displaystyle C}$ is an MDS code.
• Any ${\displaystyle k}$ columns of a generator matrix for ${\displaystyle C}$ are linearly independent.
• Any ${\displaystyle n-k}$ columns of a parity check matrix for ${\displaystyle C}$ are linearly independent.
• ${\displaystyle C^{\perp }}$ is an MDS code.
• If ${\displaystyle G=(I|A)}$ is a generator matrix for ${\displaystyle C}$ in standard form, then every square submatrix of ${\displaystyle A}$ is nonsingular.
• Given any ${\displaystyle d}$ coordinate positions, there is a (minimum weight) codeword whose support is precisely these positions.

The last of these characterizations permits, by using the MacWilliams identities, an explicit formula for the complete weight distribution of an MDS code.^[10]

Theorem: Let ${\displaystyle C}$ be a linear [${\displaystyle n,k,d}$] MDS code over ${\displaystyle \mathbb {F} _{q}}$. If ${\displaystyle A_{w}}$ denotes the number of codewords in ${\displaystyle C}$ of weight ${\displaystyle w}$, then

${\displaystyle A_{w}={\binom {n}{w}}\sum _{j=0}^{w-d}(-1)^{j}{\binom {w}{j}}(q^{w-d+1-j}-1)={\binom {n}{w}}(q-1)\sum _{j=0}^{w-d}(-1)^{j}{\binom {w-1}{j}}q^{w-d-j}.}$

Arcs in projective geometry[]

The linear independence of the columns of a generator matrix of an MDS code permits a construction of MDS codes from objects in finite projective geometry. Let ${\displaystyle PG(N,q)}$ be the finite projective space of (geometric) dimension ${\displaystyle N}$ over the finite field ${\displaystyle \mathbb {F} _{q}}$. Let ${\displaystyle K=\{P_{1},P_{2},\dots ,P_{m}\}}$ be a set of points in this projective space represented with homogeneous coordinates. Form the ${\displaystyle (N+1)\times m}$ matrix ${\displaystyle G}$ whose columns are the homogeneous coordinates of these points. Then,^[11]

Theorem: ${\displaystyle K}$ is a (spatial) ${\displaystyle m}$-arc if and only if ${\displaystyle G}$ is the generator matrix of an ${\displaystyle [m,N+1,m-N]}$ MDS code over ${\displaystyle \mathbb {F} _{q}}$.

See also[]

• Gilbert–Varshamov bound
• Plotkin bound
• Hamming bound
• Johnson bound
• Griesmer bound

Notes[]

References[]

• Joshi, D.D (1958), "A Note on Upper Bounds for Minimum Distance Codes", Information and Control, 1 (3): 289–295, doi:10.1016/S0019-9958(58)80006-6
• Komamiya, Y. (1953), "Application of logical mathematics to information theory", Proc. 3rd Japan. Nat. Cong. Appl. Math.: 437
• Ling, San; Xing, Chaoping (2004), Coding Theory / A First Course, Cambridge University Press, ISBN 0-521-52923-9
• MacWilliams, F.J.; Sloane, N.J.A. (1977), The Theory of Error-Correcting Codes, North-Holland, pp. 33, 37, ISBN 0-444-85193-3
• Pless, Vera (1998), Introduction to the Theory of Error-Correcting Codes (3rd ed.), Wiley Interscience, ISBN 0-471-19047-0
• Roman, Steven (1992), Coding and Information Theory, GTM, vol. 134, Springer-Verlag, ISBN 0-387-97812-7
• Singleton, R.C. (1964), "Maximum distance q-nary codes", IEEE Trans. Inf. Theory, 10 (2): 116–118, doi:10.1109/TIT.1964.1053661
• Vermani, L. R. (1996), Elements of algebraic coding theory, Chapman & Hall
• Welsh, Dominic (1988), Codes and Cryptography, Oxford University Press, ISBN 0-19-853287-3

Further reading[]

• J.H. van Lint (1992). Introduction to Coding Theory. GTM. Vol. 86 (2nd ed.). Springer-Verlag. p. 61. ISBN 3-540-54894-7.
• Niederreiter, Harald; Xing, Chaoping (2001). "6. Applications to algebraic coding theory". Rational points on curves over finite fields. Theory and Applications. London Mathematical Society Lecture Note Series. Vol. 285. Cambridge: Cambridge University Press. ISBN 0-521-66543-4. Zbl 0971.11033.