Sub-optimal decoding of block and lattice codes

Research output: Contribution to conferencePaperpeer-review

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 languageEnglish
Pages340-343
Number of pages4
StatePublished - 1996
EventProceedings of the 1996 19th Convention of Electrical and Electronics Engineers in Israel - Jerusalem, Isr
Duration: 5 Nov 19966 Nov 1996

Conference

ConferenceProceedings of the 1996 19th Convention of Electrical and Electronics Engineers in Israel
CityJerusalem, Isr
Period5/11/966/11/96

Fingerprint

Dive into the research topics of 'Sub-optimal decoding of block and lattice codes'. Together they form a unique fingerprint.

Cite this