Please use this identifier to cite or link to this item: https://doi.org/10.1109/TIT.2003.821966
Title: Multisequence shift register synthesis over commutative rings with identity with applications to decoding cyclic codes over integer residue rings
Authors: Armand, M.A. 
Keywords: Cyclic codes
Decoding
Galois rings
Minimal polynomials
Sequences
Issue Date: Jan-2004
Citation: Armand, M.A. (2004-01). 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. ScholarBank@NUS Repository. https://doi.org/10.1109/TIT.2003.821966
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(L2) as L → ∞. An important application of this algorithm is in the decoding of cyclic codes over ℤ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 ℤm where m is a product of prime powers.
Source Title: IEEE Transactions on Information Theory
URI: http://scholarbank.nus.edu.sg/handle/10635/82736
ISSN: 00189448
DOI: 10.1109/TIT.2003.821966
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

7
checked on Nov 13, 2018

WEB OF SCIENCETM
Citations

6
checked on Nov 13, 2018

Page view(s)

35
checked on Nov 2, 2018

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.