Maximum-distance linear codes (Corresp.)

Described here is a linear code that has a maximum distance between codewords of
k
for a code of order
2^k
. Since the minimum-maximum distance is
k
for a code of order
2^k
, a class of minimum-maximum distance codes results. For an
(n,k)
linear code,
k \leq n \leq k + k/2
for
k
even and
k \leq n \leq k + (k - 1)/2
for
k
odd. Maximum-distance codes are found useful in encoding the states of sequential circuits.