(Imperfect) strategies to generate primitive polynomials over GF(2)

DOI10.1016/J.TCS.2021.03.007zbMath1504.68135OpenAlexW3134634529MaRDI QIDQ2034772

Sukanta Das, Sumit Adak

Publication date: 23 June 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2021.03.007

zbMATH Keywords

cellular automataprimitive polynomialmaximal-length cellular automata

Mathematics Subject Classification ID

Cellular automata (computational aspects) (68Q80) Finite fields (field-theoretic aspects) (12E20) Computational methods for problems pertaining to field theory (12-08)

Cites Work

• Statistical mechanics of cellular automata
• Analysis of one-dimensional linear hybrid cellular automata over GF(q)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: (Imperfect) strategies to generate primitive polynomials over GF(2)