
doi: 10.1109/18.605601
Summary: A new soft-decision maximum-likelihood decoding algorithm is proposed, which generates a set of candidate codewords using hard-decision bounded-distance decoding . By improving the generating method of input vectors for the bounded-distance decoding due to [\textit{T. Kaneko}, \textit{T. Nishijima}, \textit{H. Inazumi} and \textit{S. Hirasawa}, ibid. 40, 320-327 (1994; Zbl 0808.94028)] decoding time complexity is reduced without degradation of performance. The space complexity is dependent on the bounded-distance decoding.
block codes, Decoding, hard-decision bounded-distance decoding, decoding time complexity, soft-decision maximum-likelihood decoding algorithm, space complexity
block codes, Decoding, hard-decision bounded-distance decoding, decoding time complexity, soft-decision maximum-likelihood decoding algorithm, space complexity
| 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). | 35 | |
| 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. | Top 10% | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Top 10% |
