Geometrical and performance analysis of GMD and Chase decoding algorithms

The overall number of nearest neighbors in bounded distance decoding (BDD) algorithms is given by N/sub 0,eff/=N/sub 0/+N/sub BDD/. Where NBDD denotes the number of additional, non-codeword, neighbors that are generated during the (suboptimal) decoding process. We identify and enumerate the nearest...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	IEEE transactions on information theory 1999-07, Vol.45 (5), p.1406-1422
Hauptverfasser:	Fishler, E., Amrani, O., Be'ery, Y.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Computer science Data transmission Decoding
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!