2 citations · 5 across the 31 of their papers we have counts for
5 papers · 1 filter
Self-Orthogonal Cellular Automata
Luca Mariot, Federico Mazzone
It is known that no-boundary Cellular Automata (CA) defined by bipermutive local rules give rise to Latin squares. In this paper, we study under which conditions the Latin square g…
On Maximal Families of Binary Polynomials with Pairwise Linear Common Factors
Maximilien Gadouleau, Luca Mariot, Federico Mazzone
We consider the construction of maximal families of polynomials over the finite field , all having the same degree and a nonzero constant term, where the degree o…
Exhaustive Generation of Linear Orthogonal Cellular Automata
Enrico Formenti, Luca Mariot
We consider the problem of exhaustively visiting all pairs of linear cellular automata which give rise to orthogonal Latin squares, i.e., linear Orthogonal Cellular Automata (OCA).…
Latin Hypercubes and Cellular Automata
Maximilien Gadouleau, Luca Mariot
Latin squares and hypercubes are combinatorial designs with several applications in statistics, cryptography and coding theory. In this paper, we generalize a construction of Latin…
Mutually Orthogonal Latin Squares based on Cellular Automata
Luca Mariot, Maximilien Gadouleau, Enrico Formenti +1
We investigate sets of Mutually Orthogonal Latin Squares (MOLS) generated by Cellular Automata (CA) over finite fields. After introducing how a CA defined by a bipermutive local ru…