Codes that attain the Hamming bound are called perfect codes. Examples include codes that have only one codeword, and codes that are the whole of . Another example is given by the repeat codes, where each symbol of the message is repeated an odd fixed number of times to obtain a codeword where q = 2. All of these examples are often called the trivial perfect codes. In 1973, it was proved that any non-trivial perfect code over a prime-power alphabet has the parameters of a Hamming code or a Golay code.
A perfect code may be interpreted as one in which the balls of Hamming radius t centered on codewords exactly fill out the space (t is the covering radius = packing radius). A quasi-perfect code is one in which the balls of Hamming radius t centered on codewords are disjoint and the balls of radius t+1 cover the space, possibly with some overlaps. Another way to say this is that a code is quasi-perfect if its covering radius is one greater than its packing radius.
Read more about this topic: Hamming Bound
Famous quotes containing the words perfect and/or codes:
“The perfect aphorism would achieve classical balance and then immediately upset it.”
—Mason Cooley (b. 1927)
“We must trust infinitely to the beneficent necessity which shines through all laws. Human nature expresses itself in them as characteristically as in statues, or songs, or railroads, and an abstract of the codes of nations would be an abstract of the common conscience.”
—Ralph Waldo Emerson (1803–1882)