Sub-optimal decoding of block and lattice codes

摘要

We present several bounded distance decoding algorithms for a family of block codes. These algorithms can be efficiently employed for decoding lattice codes. A thorough investigation of the performance and decision regions of the proposed algorithms are performed. These suggest that there are three distinct types of nearest neighbors classified according to their affect on the decision region.