On Chase-Like Bound-Distance Decoding Algorithms
Ling bin Yan, Li rong Yu, Wei jia Lu, Hai feng Xu, Yuan sheng Tang
Ling bin Yan
Available Online August 2013.
- https://doi.org/10.2991/icacsei.2013.60How to use a DOI?
- Chase-like algorithm, algebraic binary decoder, bounded-distance decoding
- 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 .
- Open Access
- This is an open access article distributed under the CC BY-NC license.
Cite this article
TY - CONF AU - Ling bin Yan AU - Li rong Yu AU - Wei jia Lu AU - Hai feng Xu AU - Yuan sheng Tang PY - 2013/08 DA - 2013/08 TI - On Chase-Like Bound-Distance Decoding Algorithms BT - 2013 International Conference on Advanced Computer Science and Electronics Information (ICACSEI 2013) PB - Atlantis Press SN - 1951-6851 UR - https://doi.org/10.2991/icacsei.2013.60 DO - https://doi.org/10.2991/icacsei.2013.60 ID - Yan2013/08 ER -