Minimal Polynomial Algorithms for Finite Sequences

DOI10.1109/TIT.2010.2054150MaRDI QIDQ5281314zbMATH OpenFDO

Authors G. H. Norton

Publication date 27 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0911.0130

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Abstract: We show that a straightforward rewrite of a known minimal polynomial algorithm yields a simpler version of a recent algorithm of A. Salagean.

Cited in

(9)

• Some basic results on finite linear recurring sequence subgroups
• Connection between classification and minimum polynomial of multiplexed sequences
• scientific article; zbMATH DE number 3987032 (Why is no real title available?)
• On the Minimal Elements for the Sequence of all Powers in the Lemoine-Katai Algorithm
• scientific article; zbMATH DE number 742981 (Why is no real title available?)
• Algorithms for the Minimal Rational Fraction Representation of Sequences Revisited
• An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings
• On finding minimal, maximal, and consistent sequences over a binary alphabet
• Minimal polynomials of the modified de Bruijn sequences

This page was built for publication: Minimal Polynomial Algorithms for Finite Sequences

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