article · IEEE Transactions on Information Theory · 1974
Decoding beyond the BCH bound using multiple sets of syndrome sequences (Corresp.)
Carlos R. P. Hartmann, Kenneth K. Tzeng
Cited by 23Abstract and details only
Abstract
Many cyclic codes are generated by polynomials possessing more than one set of consecutive roots. Thus more than one set of syndrome sequences are available for decoding. In this correspondence, a decoding method based on Berlekamp's iterative algorithm is presented which makes use of the multiple sets of syndrome sequences for decoding such cyclic codes beyond the BCH bound.
Cite this paper
Hartmann, C. R. P., & Tzeng, K. K. (1974). Decoding beyond the BCH bound using multiple sets of syndrome sequences (Corresp.). IEEE Transactions on Information Theory, 20(2), 292–295. https://doi.org/10.1109/tit.1974.1055178
Hartmann, Carlos R. P., and Kenneth K. Tzeng. “Decoding beyond the BCH bound using multiple sets of syndrome sequences (Corresp.).” IEEE Transactions on Information Theory, vol. 20, no. 2, 1974, pp. 292–95, https://doi.org/10.1109/tit.1974.1055178.
Hartmann, Carlos R. P., and Kenneth K. Tzeng. 1974. “Decoding beyond the BCH bound using multiple sets of syndrome sequences (Corresp.).” IEEE Transactions on Information Theory 20 (2): 292–95. https://doi.org/10.1109/tit.1974.1055178.
Hartmann, C.R.P. and Tzeng, K.K. (1974) ‘Decoding beyond the BCH bound using multiple sets of syndrome sequences (Corresp.)’, IEEE Transactions on Information Theory, 20(2), pp. 292–295. Available at: https://doi.org/10.1109/tit.1974.1055178.
@article{hartmann1974decoding,
title = {{Decoding beyond the BCH bound using multiple sets of syndrome sequences (Corresp.)}},
author = {Hartmann, Carlos R. P. and Tzeng, Kenneth K.},
journal = {IEEE Transactions on Information Theory},
volume = {20},
number = {2},
pages = {292--295},
year = {1974},
doi = {10.1109/tit.1974.1055178}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.
Related papers
Decoding beyond the BCH bound (Corresp.)
Carlos R. P. Hartmann · IEEE Transactions on Information Theory · 1972
Cited by 43
A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes
G.L. Feng, Kenneth K. Tzeng · IEEE Transactions on Information Theory · 1991
Cited by 200
On Iterative Decoding of Bch Codes and Decoding Beyond the Bch Bound
Kenneth K. Tzeng · Illinois Digital Environment for Access to Learning and Scholarship (University of Illinois at Urbana-Champaign) · 1969
Cited by 3
A branching control circuit for Berlekamp's BCH decoding algorithm (Corresp.)
D.D. Sullivan · IEEE Transactions on Information Theory · 1972
Cited by 2
Multisequence Shift Register Synthesis Over Commutative Rings With Identity With Applications to Decoding Cyclic Codes Over Integer Residue Rings
M.A. Armand · IEEE Transactions on Information Theory · 2004
Cited by 9
Iterative multi-step decoding for a class of multi-step majority-logic decodable cyclic codes
Hsiu-Chi Chang, Hsie-Chia Chang · International Symposium on Turbo Codes and Iterative Information Processing · 2014
Cited by 0
A New Procedure for Decoding Cyclic and Bch Codes Up to Actual Minimum Distance
G.L. Feng, Kenneth K. Tzeng · IEEE International Symposium on Information Theory (ISIT) · 2005
Cited by 4