On the minimal realizations of a finite sequence

DOI10.1006/jsco.1995.1040zbMath0856.94016OpenAlexW2052089362MaRDI QIDQ1911405

Graham H. Norton

Publication date: 25 February 1997

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.1995.1040

zbMATH Keywords

algorithmminimal realizationlinear complexitylinear recurring sequence

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Shift register sequences and sequences over finite alphabets in information and communication theory (94A55)

Related Items (4)

Some decoding applications of minimal realization ⋮ Applications of the theory of Gröbner bases to the study of linear recurring arrays ⋮ On sequences, rational functions and decomposition ⋮ Some basic results on finite linear recurring sequence subgroups

This page was built for publication: On the minimal realizations of a finite sequence