Enumerating orthogonal Latin squares generated by bipermutive cellular automata

DOI10.1007/978-3-319-58631-1_12zbMath1451.05031OpenAlexW2610597885MaRDI QIDQ1704110

Enrico Formenti, Luca Mariot, Alberto Leporati

Publication date: 8 March 2018

Full work available at URL: https://hal.inria.fr/hal-01656352/file/447449_1_En_12_Chapter.pdf

zbMATH Keywords

Latin squarescellular automatabipermutivitypairwise balancedness

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Orthogonal arrays, Latin squares, Room squares (05B15) Cellular automata (computational aspects) (68Q80)

Related Items (3)

Inversion of Mutually Orthogonal Cellular Automata ⋮ On the Linear Components Space of S-boxes Generated by Orthogonal Cellular Automata ⋮ Mutually orthogonal Latin squares based on cellular automata

This page was built for publication: Enumerating orthogonal Latin squares generated by bipermutive cellular automata