Skip to Main Content
An error-correcting code may be thought of as a subset of points belonging to a set in which a metric is defined such that the distance between every pair of distinct points of is larger than some given number. In Hamming's original formulation, was taken to be the set of all -bit binary numbers and the distance between a pair of binary numbers and was taken to be the number of bits of which do not agree with the corresponding bits of . In this note we shall take to be the set of all -tuples in which each coordinate of an -tuple can assume one of integral values: , with . Properties of these nonbinary codes will be discussed.