Abstract
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.
| Original language | English |
|---|---|
| Pages | 340-343 |
| Number of pages | 4 |
| State | Published - 1996 |
| Event | Proceedings of the 1996 19th Convention of Electrical and Electronics Engineers in Israel - Jerusalem, Isr Duration: 5 Nov 1996 → 6 Nov 1996 |
Conference
| Conference | Proceedings of the 1996 19th Convention of Electrical and Electronics Engineers in Israel |
|---|---|
| City | Jerusalem, Isr |
| Period | 5/11/96 → 6/11/96 |