The Berlekamp–Massey algorithm over finite rings, modules, and bimodules

DOI10.1515/DMA.1998.8.5.441zbMATH Open1001.94518OpenAlexW2042994762MaRDI QIDQ4522759FDOQ4522759

Authors: V. L. Kurakin 

Publication date: 14 August 2001

Published in: Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/dma.1998.8.5.441

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Decoding (94B35)

Cited In (6)

• Representations of skew linear recurrent sequences of maximal period over finite field;Представления скрученных линейных рекуррентных последовательностей максимального периода над конечным полем
• Description of maximal skew linear recurrences in terms of multipliers
• A construction of skew LRS of maximal period over finite fields based on the defining tuples of factors
• Skew linear recurring sequences of maximal period over Galois rings
• Algorithms for linearly recurrent sequences of truncated polynomials
• An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings

This page was built for publication: The Berlekamp–Massey algorithm over finite rings, modules, and bimodules

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4522759)