article · IEEE Transactions on Information Theory · 1997
An improvement of soft-decision maximum-likelihood decoding algorithm using hard-decision bounded-distance decoding
T. Kaneko, Takeshi Nishijima, Shigeichi Hirasawa
Cited by 47Abstract and details only
Abstract
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 Kaneko et al. (see ibid., vol.40, no.3, p.320-27, 1994), the decoding time complexity is reduced without degradation of the performance. The space complexity is dependent on the bounded-distance decoding.
Cite this paper
Kaneko, T., Nishijima, T., & Hirasawa, S. (1997). An improvement of soft-decision maximum-likelihood decoding algorithm using hard-decision bounded-distance decoding. IEEE Transactions on Information Theory, 43(4), 1314–1319. https://doi.org/10.1109/18.605601
Kaneko, T., et al. “An improvement of soft-decision maximum-likelihood decoding algorithm using hard-decision bounded-distance decoding.” IEEE Transactions on Information Theory, vol. 43, no. 4, 1997, pp. 1314–19, https://doi.org/10.1109/18.605601.
Kaneko, T., Takeshi Nishijima, and Shigeichi Hirasawa. 1997. “An improvement of soft-decision maximum-likelihood decoding algorithm using hard-decision bounded-distance decoding.” IEEE Transactions on Information Theory 43 (4): 1314–19. https://doi.org/10.1109/18.605601.
Kaneko, T., Nishijima, T. and Hirasawa, S. (1997) ‘An improvement of soft-decision maximum-likelihood decoding algorithm using hard-decision bounded-distance decoding’, IEEE Transactions on Information Theory, 43(4), pp. 1314–1319. Available at: https://doi.org/10.1109/18.605601.
@article{kaneko1997improvement,
title = {{An improvement of soft-decision maximum-likelihood decoding algorithm using hard-decision bounded-distance decoding}},
author = {Kaneko, T. and Nishijima, Takeshi and Hirasawa, Shigeichi},
journal = {IEEE Transactions on Information Theory},
volume = {43},
number = {4},
pages = {1314--1319},
year = {1997},
doi = {10.1109/18.605601}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.