This correspondence introduces a general construction method of perfect/quasi-perfect Lee distance codes in Z2. K. For this class of codes, a constant-time ...
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.
A construction of perfect/quasiperfect Lee distance codes in Z/sub K//sup 2/ is introduced, a constant time encoding scheme is defined, the minimum code ...
A code D over Z 2 n is called a quasi-perfect Lee distance-(2t + 1) code if d L(V,W) ≥ 2t + 1 for every two code words V,W in D, and every word in Z 2 n is ...
People also ask
What is a quasi perfect code?
What are quasi-cyclic codes?
Fast decoding of quasi-perfect Lee distance codes. A code D over Z 2 n is called a quasi-perfect Lee distance-(2 t + 1) code if d L ( V , W ) 2 t + 1 for ...
A code D over Z 2n is called a quasi-perfect Lee distance-(2t + 1) code if d L(V,W) ≥ 2t + 1 for every two code words V,W in D, and every word in Z 2n is ...
A code D over Z 2 n is called a quasi-perfect Lee distance-(2 t + 1) code if d L ( V , W ) 2 t + 1 for every two code words V , W in D , and every word in Z ...
Jan 20, 2024 · Abstract:Constructions of distance-optimal codes and quasi-perfect codes are challenging problems and have attracted many attentions.
A construction of perfect/quasi-perfect Lee distance codes over ZK2 for any K is designed. The minimum distance and the covering radius of these codes are ...
In [12] an efficient algorithm for decoding quasi-perfect Lee distance codes is presented. Regardless of q , the number of elementary operations used by the ...