On the binary sequence (1,1,0,1,0³,1,0⁷,1,0¹⁵,)

DOI10.1017/S0004972724000601MaRDI QIDQ6961801zbMATH OpenFDO

Authors G. H. Norton

Publication date 10 July 2025

Published in Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1017/S0004972724000601

zbMATH Keywords

annihilator idealfinite sequenceformhomogeneous ideallinear complexityMacaulay's inverse system

Mathematics Subject Classification ID

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

Cites work

• A relationship between the Berlekamp-Massey and the euclidean algorithms for linear feedback shift register synthesis
• Analysis and design of stream ciphers
• scientific article; zbMATH DE number 3882549 (Why is no real title available?)
• scientific article; zbMATH DE number 4062985 (Why is no real title available?)
• On the annihilator ideal of an inverse form
• On the annihilator ideal of an inverse form: addendum
• On the key equation
• On the minimal realizations of a finite sequence
• Proof of Rueppel's linear complexity conjecture (Corresp.)
• Shift-register synthesis and BCH decoding

This page was built for publication: On the binary sequence \((1,1,0,1,0^3,1,0^7,1,0^{15},\dots)\)

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