On Chase-Like Bound-Distance Decoding Algorithms
On Chase-Like Bound-Distance Decoding Algorithms
* The work was supported by the Students' Practice and Innovation Training Program of Jiangsu Province (2012JSSPITP1342), the Natural Science Foundation of China (No. 60971123), the Key Project of Chinese Ministry of Education (No. 208045) and the Open Foundation of NCRL of Southeast University (W200819) Abstract 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
- Yangzhou University China (People's Republic of)
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!