A generalization of the Massey-Ding algorithm

DOI10.1007/s002000050092zbMath0931.11003OpenAlexW1971652658MaRDI QIDQ1389143

Joachim Althaler, Arne Dür

Publication date: 12 August 1998

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

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

zbMATH Keywords

annihilator ideallinear recurrence relationminimal Gröbner basisMassey-Ding algorithmshift register synthesis problem

Mathematics Subject Classification ID

Shift register sequences and sequences over finite alphabets in information and communication theory (94A55) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Recurrences (11B37)

Related Items (1)

Linear feedback shift registers and the minimal realization problem

This page was built for publication: A generalization of the Massey-Ding algorithm