Linear recurring sequences over modules

DOI10.1007/BF00047168zbMath0854.11067OpenAlexW1972925812MaRDI QIDQ1906803

Alexander V. Mikhalev, Alexander A. Nechaev

Publication date: 19 January 1997

Published in: Acta Applicandae Mathematicae (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00047168

zbMATH Keywords

Galois ringsquasi-Frobenius modulesperiodic sequencelinear recurring sequence

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Cryptography (94A60) Quasi-Frobenius rings (16L60) Recurrences (11B37) Polynomials over finite fields (11T06)

Related Items

Discrete multidimensional systems over \(\mathbb Z _{n}\), On Retarded Nonlinear Time-Delay Systems That Generate Neutral Input-Output Equations, The discrete multidimensional MPUM, PRIMITIVITY OF FINITE SEMIFIELDS WITH 64 AND 81 ELEMENTS, Weak and strong orders of linear recurring sequences, An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings, Linear Recurring Sequences over Zero-Sum Semirings, Finite Rings with Applications, Artinian bimodule with quasi-Frobenius bimodule of translations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding a minimal set of linear recurring relations capable of generating a given finite two-dimensional array
• Arithmetical properties of sequences in rings
• A simple derivation of the Berlekamp- Massey algorithm and some applications (Corresp.)
• Construction of noise-resistant codes by means of linear recurrences over Galois rings
• A Duality Theory for Injective Modules. (Theory of Quasi-Frobenius Modules)
• Linear Recurring Sequences
• On the continuous dual of a polynomial bialgebra
• Kerdock code in a cyclic form
• On the Period Length of Pseudorandom Vector Sequences Generated by Matrix Generators
• The first coordinate sequence of a linear recurrence of maximal period over a Galois ring
• On determining the independent point set for doubly periodic arrays and encoding two-dimensional cyclic codes and their duals
• Linear recurrence sequences over commutative rings
• On the cycle structure of linear recurring sequences.
• Singular shift registers over residue class rings
• Difference operators and periodic sequences over finite modules
• Analysis of the Berlekamp-Massey Linear Feedback Shift-Register Synthesis Algorithm
• Period of a linear recurrence
• General theory of doubly periodic arrays over an arbitrary finite field and its applications
• CYCLE TYPES OF LINEAR SUBSTITUTIONS OVER FINITE COMMUTATIVE RINGS
• Convolution of linear recurrent sequences
• Structure of the Hopf algebras of linear recurrent sequences
• On Sequences Defined by Linear Recurrence Relations
• The Arithmetical Theory of Linear Recurring Series
• Generalized analytic functions
• Modules of Sequences of Elements of a Ring
• A Note on Linear Recurrent Sequences Modulo m
• Some Periodicity Properties of Modules over the Ring of Polynomials with Coefficients in a Residue Class Rring
• Linear Recurring Sequences over Finite Fields.
• Shift-register synthesis and BCH decoding
• Some Periodicity Properties of Transformations on Vector Spaces Over Residue Class Rings
• A theory of two-dimensional linear recurring arrays
• Periodicity of Recurring Sequences in Rings.
• Congruence Relationships for Integral Recurrences
• An Isomorphism Between Linear Recurring Sequences and Algebraic Rings
• Linear Recurrence Relations