On Minimal Realization Over a Finite Chain Ring

Authors:
Graham Norton
Affiliations:
Algebraic Coding Research Group, Centre for Communications Research, University of Bristol, England
Venue:
Designs, Codes and Cryptography
Year:
1999

Citing 4
Cited 1

Precise analyses of the right- and left-shift greatest common divisor algorithms for GF(q)Uxe

SIAM Journal on Computing
On the minimal realizations of a finite sequence

Journal of Symbolic Computation
On shortest linear recurrences

Journal of Symbolic Computation
On the decoding of Reed-Solomon and BCH codes over integer residue rings

IEEE Transactions on Information Theory

On the Key Equation Over a Commutative Ring

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

Let Rbe a finite chain ring, e.g. a Galois ring. We give a compactrecursive formula for a minimal realization of a finite R-sequence.In particular, we show how to obtain a monic minimal polynomialand a rational approximation of a finite R-sequence.We also show how to solve the classical key equation of AlgebraicCoding Theory over R.