A study on maximal length cellular automata and primitive polynomials in GF(2)

MaRDI QIDQ5010332zbMATH OpenFDO

Authors Sumit Adak, Sukanta Das

Publication date 25 August 2021

Full work available at URL https://www.oldcitypublishing.com/journals/jca-home/jca-issue-contents/jca-volume-14-number-3-4-2019/jca-14-3-4-p-289-310/

zbMATH Keywords

cellular automata (CAs)component CAconjugate CAirreducible polynomialmaximal length CAsprimitive polynomialrule

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Cellular automata (computational aspects) (68Q80)

Recommendations

• Maximum length cellular automaton sequences and its application
• (Imperfect) strategies to generate primitive polynomials over GF(2)
• scientific article; zbMATH DE number 691490
• scientific article; zbMATH DE number 7123490
• Simple cellular automata as pseudorandom m -sequence generators for built-in self-test

Cited in

(2)

• Maximum length cellular automaton sequences and its application
• (Imperfect) strategies to generate primitive polynomials over GF(2)

This page was built for publication: A study on maximal length cellular automata and primitive polynomials in GF(2)

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