article · IEEE Transactions on Information Theory · 2004
Multisequence Shift Register Synthesis Over Commutative Rings With Identity With Applications to Decoding Cyclic Codes Over Integer Residue Rings
Cited by 9Abstract and details only
Abstract
We present a new algorithm for solving the multisequence shift register synthesis problem over a commutative ring R with identity. Given a finite set of R-sequences, each of length L, the complexity of our algorithm in terms of R-multiplications is O(L/sup 2/) as L /spl rarr/ /spl infin/. An important application of this algorithm is in the decoding of cyclic codes over Z/sub q/ up to the Hartmann-Tzeng bound, where q is a prime power. Characterization of the set of monic characteristic polynomials of a prescribed set of multiple syndrome sequences leads to an efficient decoding procedure, which we further extend to decode cyclic codes over Z/sub m/ where m is a product of prime powers.
Cite this paper
Armand, M. (2004). Multisequence Shift Register Synthesis Over Commutative Rings With Identity With Applications to Decoding Cyclic Codes Over Integer Residue Rings. IEEE Transactions on Information Theory, 50(1), 220–229. https://doi.org/10.1109/tit.2003.821966
Armand, M.A. “Multisequence Shift Register Synthesis Over Commutative Rings With Identity With Applications to Decoding Cyclic Codes Over Integer Residue Rings.” IEEE Transactions on Information Theory, vol. 50, no. 1, 2004, pp. 220–29, https://doi.org/10.1109/tit.2003.821966.
Armand, M.A. 2004. “Multisequence Shift Register Synthesis Over Commutative Rings With Identity With Applications to Decoding Cyclic Codes Over Integer Residue Rings.” IEEE Transactions on Information Theory 50 (1): 220–29. https://doi.org/10.1109/tit.2003.821966.
Armand, M. (2004) ‘Multisequence Shift Register Synthesis Over Commutative Rings With Identity With Applications to Decoding Cyclic Codes Over Integer Residue Rings’, IEEE Transactions on Information Theory, 50(1), pp. 220–229. Available at: https://doi.org/10.1109/tit.2003.821966.
@article{armand2004multisequence,
title = {{Multisequence Shift Register Synthesis Over Commutative Rings With Identity With Applications to Decoding Cyclic Codes Over Integer Residue Rings}},
author = {Armand, M.A.},
journal = {IEEE Transactions on Information Theory},
volume = {50},
number = {1},
pages = {220--229},
year = {2004},
doi = {10.1109/tit.2003.821966}
}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
Multisequence generation and decoding of cyclic codes over Z/sub q/
J. Carmelo Interlando, Reginaldo Palazzo · IEEE International Symposium on Information Theory (ISIT) · 2002
Cited by 2
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 the decoding of Reed-Solomon and BCH codes over integer residue rings
J. Carmelo Interlando, Reginaldo Palazzo, Michele Elia · IEEE Transactions on Information Theory · 1997
Cited by 47
The Vector Key Equation and Multisequence Shift Register Synthesis
Liping Wang · Lecture notes in computer science · 2006
Cited by 4
Modified Berlekamp-Massey algorithm for decoding BCH codes defined over rings
J. Carmelo Interlando, Reginaldo Palazzo · IEEE International Symposium on Information Theory (ISIT) · 2002
Cited by 3
A generalized Euclidean algorithm for multisequence shift-register synthesis
G.L. Feng, Kenneth K. Tzeng · IEEE Transactions on Information Theory · 1989
Cited by 67
Shift-register synthesis and BCH decoding
James L. Massey · IEEE Transactions on Information Theory · 1969
Cited by 2,206
Transform decoding of BCH codes overZm
Balaji Sundar Rajan, Mohammad Umar Siddiqi · International Journal of Electronics · 1993
Cited by 6