Minimal Polynomial Algorithms for Finite Sequences

DOI10.1109/TIT.2010.2054150zbMath1366.94451arXiv0911.0130MaRDI QIDQ5281314

Graham 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)

Related Items (2)

An iterative algorithm for parametrization of shortest length linear shift registers over finite chain rings ⋮ Some basic results on finite linear recurring sequence subgroups

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