Title :
The zero-coverings algorithm for general minimum distance decoding problem
Author :
Han, Yunghsiang S.
Author_Institution :
Dept. of Electron. Eng., Hua Fan Coll. of Humanities & Technol., Taipei, Taiwan
fDate :
29 Jun-4 Jul 1997
Abstract :
The author presents a new improved version of the zero-neighbors algorithm-the zero-coverings algorithm. He shows that the zero-coverings algorithm is the best algorithm which performs a zero-neighbors algorithm like decoding procedure
Keywords :
block codes; computational complexity; decoding; linear codes; NP-hard computational problem; general minimum distance decoding problem; linear block code; zero-coverings algorithm; zero-neighbors algorithm; Block codes; Councils; Decoding; Educational institutions; Entropy; Hamming weight; Polynomials; Vectors;
Conference_Titel :
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location :
Ulm
Print_ISBN :
0-7803-3956-8
DOI :
10.1109/ISIT.1997.613258
