Skip to Main Content
A construction of perfect/quasiperfect Lee distance codes in ZK2 is introduced. For this class of codes, a constant time encoding scheme is defined, the minimum code distance is derived, and the maximum covering radius is calculated. Efficient decoding schemes are investigated and developed. In general, a code of this class can be decoded in O(t1), where t1 is the number of errors that can be corrected. Special cases, however, can be decoded in constant time.
Date of Publication: June 2003