article · IEEE Transactions on Information Theory · 1982
New decoding algorithm for Reed - Muller codes (Corresp.)
Kin‐ichiroh Tokiwa, Tatsuo Sugimura, M. Kasahara, T. Namekawa
Cited by 6Abstract and details only
Abstract
We interpret Reed-Muller codes in terms of superimposition and present a new decoding algorithm for Reed-Muller codes. Before presenting this algorithm, we propose a decoding algorithm for a class of simple iterated codes (SI codes) that will play an important role in our new decoding algorithm. Finally, we compare our algorithm with the conventional algorithm for the cyclic Reed-Muller codes from the standpoint of decoding delay.
Cite this paper
Tokiwa, K., Sugimura, T., Kasahara, M., & Namekawa, T. (1982). New decoding algorithm for Reed - Muller codes (Corresp.). IEEE Transactions on Information Theory, 28(5), 779–787. https://doi.org/10.1109/tit.1982.1056554
Tokiwa, Kin‐ichiroh, et al. “New decoding algorithm for Reed - Muller codes (Corresp.).” IEEE Transactions on Information Theory, vol. 28, no. 5, 1982, pp. 779–87, https://doi.org/10.1109/tit.1982.1056554.
Tokiwa, Kin‐ichiroh, Tatsuo Sugimura, M. Kasahara, and T. Namekawa. 1982. “New decoding algorithm for Reed - Muller codes (Corresp.).” IEEE Transactions on Information Theory 28 (5): 779–87. https://doi.org/10.1109/tit.1982.1056554.
Tokiwa, K. et al. (1982) ‘New decoding algorithm for Reed - Muller codes (Corresp.)’, IEEE Transactions on Information Theory, 28(5), pp. 779–787. Available at: https://doi.org/10.1109/tit.1982.1056554.
@article{tokiwa1982decoding,
title = {{New decoding algorithm for Reed - Muller codes (Corresp.)}},
author = {Tokiwa, Kin‐ichiroh and Sugimura, Tatsuo and Kasahara, M. and Namekawa, T.},
journal = {IEEE Transactions on Information Theory},
volume = {28},
number = {5},
pages = {779--787},
year = {1982},
doi = {10.1109/tit.1982.1056554}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.