Ling bin Yan, Li rong Yu, Wei jia Lu, Hai feng Xu, Yuan sheng Tang
For the decoding of a binary linear block code of Hamming distance of d over AWGN channels, a soft-decision decoder is said to be bounded-distance (BD) decoding if its squared error-correction radius is equal to d. A Chase-like algorithm outputs the best (most likely) codeword in a list of candidates generated by a conventional algebraic binary decoder whose input vectors are determined by the reliability order of the hard-decisions. Let (d) denote the smallest size of input vector sets of Chase-like algorithms which achieve BD decoding. When d approaches to infinity, the best known upper bound on (d) is (d) ( + o(1))d1/2, where 2.414. In this paper, we show (d) ( + o(1))d1/2), where 2.218 .