Fast decoding of quasi-perfect Lee distance codes |
| |
| Authors: | Peter Horak Bader F AlBdaiwi |
| |
| Institution: | (1) Interdisciplinary Arts and Sciences, University of Washington, Tacoma, WA, USA;(2) Department of Mathematics and Computer Science, Kuwait University, Kuwait |
| |
| Abstract: | 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 at distance ≤ t + 1 from at least one code word, where D
L(V,W) is the Lee distance of V and W. In this paper we present a fast decoding algorithm for quasi-perfect Lee codes. The basic idea of the algorithm comes from
a geometric representation of D in the 2-dimensional plane. It turns out that to decode a word it suffices to calculate its distance to at most four code
words. |
| |
| Keywords: | Lee codes Fast decoding |
| 本文献已被 SpringerLink 等数据库收录！ |
|
