Proof
First observe that there are many q-ary words of length, since each letter in such a word may take one of different values, independently of the remaining letters.
Now let be an arbitrary q-ary block code of minimum distance . Clearly, all codewords are distinct. If we delete the first letters of each codeword, then all resulting codewords must still be pairwise different, since all original codewords in have Hamming distance at least from each other. Thus the size of the code remains unchanged.
The newly obtained codewords each have length
and thus there can be at most
of them. Hence the original code shares the same bound on its size :
Read more about this topic: Singleton Bound
Famous quotes containing the word proof:
“If we view our children as stupid, naughty, disturbed, or guilty of their misdeeds, they will learn to behold themselves as foolish, faulty, or shameful specimens of humanity. They will regard us as judges from whom they wish to hide, and they will interpret everything we say as further proof of their unworthiness. If we view them as innocent, or at least merely ignorant, they will gain understanding from their experiences, and they will continue to regard us as wise partners.”
—Polly Berrien Berends (20th century)
“There is no better proof of a man’s being truly good than his desiring to be constantly under the observation of good men.”
—François, Duc De La Rochefoucauld (1613–1680)
“He who has never failed somewhere, that man can not be great. Failure is the true test of greatness. And if it be said, that continual success is a proof that a man wisely knows his powers,—it is only to be added, that, in that case, he knows them to be small.”
—Herman Melville (1819–1891)