An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings
From MaRDI portal
(Redirected from Publication:522204)
Abstract: The construction of shortest feedback shift registers for a finite sequence S_1,...,S_N is considered over the finite ring Z_{p^r}. A novel algorithm is presented that yields a parametrization of all shortest feedback shift registers for the sequence of numbers S_1,...,S_N, thus solving an open problem in the literature. The algorithm iteratively processes each number, starting with S_1, and constructs at each step a particular type of minimal Gr"obner basis. The construction involves a simple update rule at each step which leads to computational efficiency. It is shown that the algorithm simultaneously computes a similar parametrization for the reciprocal sequence S_N,...,S_1.
Recommendations
- scientific article; zbMATH DE number 4012492
- A linear algebraic approach to multisequence shift-register synthesis
- Linear feedback shift registers and the minimal realization problem
- Shift Register Synthesis (Modulo m)
- A new algorithm on the minimal rational fraction representation of feedback with carry shift registers
Cites work
- scientific article; zbMATH DE number 3910296 (Why is no real title available?)
- scientific article; zbMATH DE number 638938 (Why is no real title available?)
- A Parametric Approach to List Decoding of Reed-Solomon Codes Using Interpolation
- Algebraic coding theory
- An Algorithm for Computing Minimal Bidirectional Linear Recurrence Relations
- An efficient algorithm for constructing minimal trellises for codes over finite abelian groups
- Analysis and design of stream ciphers
- Canonical generating system of a monic polynomial ideal over a commutative Artinian chain ring
- Comparison of two algorithms for decoding alternant codes
- Convolutional codes I: Algebraic structure
- Cyclic codes and minimal strong Gröbner bases over a principal ideal ring.
- Gröbner bases over Galois rings with an application to decoding alternant codes
- Hamming metric decoding of alternant codes over Galois rings
- Linear recurrence sequences over commutative rings
- Linear recurring sequences over modules
- Linear recurring sequences over rings and modules
- List decoding of Reed-Solomon codes from a Gröbner basis perspective
- Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
- Minimal Gröbner bases and the predictable leading monomial property
- Minimal Polynomial Algorithms for Finite Sequences
- New List Decoding Algorithms for Reed–Solomon and BCH Codes
- On constructing a shortest linear recurrence relation
- On minimal realization over a finite chain ring
- On the decoding of Reed-Solomon and BCH codes over integer residue rings
- On the key equation
- Shift Register Synthesis (Modulo m)
- Shift-register synthesis and BCH decoding
- Standard basis of a polynomial ideal over commutative Artinian chain ring
- The Berlekamp–Massey algorithm over finite rings, modules, and bimodules
- The predictable degree property and row reducedness for systems over a finite ring
Cited in
(5)- State representations of convolutional codes over a finite ring
- Searching Short Recurrences of Nonlinear Shift Registers via Directed Acyclic Graphs
- On lattice-based algebraic feedback shift registers synthesis for multisequences
- A matrix based list decoding algorithm for linear codes over integer residue rings
- Noncatastrophic convolutional codes over a finite ring
This page was built for publication: An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q522204)
