Title :
On the number of search centers of Chase-like bounded-distance decoding
Author :
Tang, Yuansheng ; Huang, Xinmei ; Yan, Tingsu ; Chen, Ming
Author_Institution :
Coll. of Math. Sci., Yangzhou Univ., Yangzhou
Abstract :
It is recently of interest to design Chase-like algorithms to achieve BD decoding with as least trials as possible. In this paper, we show that Chase-like algorithms can achieve bounded-distance decoding with only O(radic(d ln d)) trials, where d is the minimal Hamming distance of the code.
Keywords :
AWGN channels; Hamming codes; binary codes; block codes; decoding; linear codes; Hamming distance; additive white Gaussian noise channels; binary linear block codes; chase-like bounded-distance decoding; search centers; AWGN; Additive white noise; Algorithm design and analysis; Block codes; Decoding; Electronic mail; Error probability; Euclidean distance; H infinity control; Hamming distance;
Conference_Titel :
Information Theory and Its Applications, 2008. ISITA 2008. International Symposium on
Conference_Location :
Auckland
Print_ISBN :
978-1-4244-2068-1
Electronic_ISBN :
978-1-4244-2069-8
DOI :
10.1109/ISITA.2008.4895566
