An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings
From MaRDI portal
Publication:522204
DOI10.1007/s10623-016-0226-3zbMath1381.94054arXiv1201.5921OpenAlexW3105539080MaRDI QIDQ522204
Raquel Pinto, Margreta Kuijper
Publication date: 13 April 2017
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1201.5921
Finite rings and finite-dimensional associative algebras (16P10) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)
Related Items
State representations of convolutional codes over a finite ring ⋮ A matrix based list decoding algorithm for linear codes over integer residue rings ⋮ Noncatastrophic convolutional codes over a finite ring
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimal Gröbner bases and the predictable leading monomial property
- List decoding of Reed-Solomon codes from a Gröbner basis perspective
- The predictable degree property and row reducedness for systems over a finite ring
- Analysis and design of stream ciphers
- Comparison of two algorithms for decoding alternant codes
- On minimal realization over a finite chain ring
- Cyclic codes and minimal strong Gröbner bases over a principal ideal ring.
- Linear recurring sequences over modules
- Linear recurring sequences over rings and modules
- An efficient algorithm for constructing minimal trellises for codes over finite abelian groups
- Minimal Bases of Rational Vector Spaces, with Applications to Multivariable Linear Systems
- New List Decoding Algorithms for Reed–Solomon and BCH Codes
- Shift Register Synthesis (Modulo m)
- Linear recurrence sequences over commutative rings
- On the decoding of Reed-Solomon and BCH codes over integer residue rings
- On constructing a shortest linear recurrence relation
- The Berlekamp–Massey algorithm over finite rings, modules, and bimodules
- Hamming metric decoding of alternant codes over Galois rings
- Canonical generating system of a monic polynomial ideal over a commutative Artinian chain ring
- Standard basis of a polynomial ideal over commutative Artinian chain ring
- On the key equation
- An Algorithm for Computing Minimal Bidirectional Linear Recurrence Relations
- A Parametric Approach to List Decoding of Reed-Solomon Codes Using Interpolation
- Minimal Polynomial Algorithms for Finite Sequences
- Shift-register synthesis and BCH decoding
- Convolutional codes I: Algebraic structure
- Gröbner bases over Galois rings with an application to decoding alternant codes
