Welch sets for random generation and representation of reversible one-dimensional cellular automata

DOI10.1016/j.ins.2016.12.009zbMath1429.68144MaRDI QIDQ2292949

Genaro J. Martínez, Irving Barragan-Vite, Juan Carlos Seck-Tuoh-Mora, Norberto Hernández-Romero, Joselito Medina-Marín

Publication date: 6 February 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2016.12.009

zbMATH Keywords

bipartite graph; cellular automata; reversibility; block mapping; Welch indices

Mathematics Subject Classification ID

68Q80: Cellular automata (computational aspects)

Related Items

A closed formula for the inverse of a reversible cellular automaton with \((2 R + 1)\)-cyclic rule

Cites Work

• Unnamed Item
• Rectangular groupoids and related structures
• Invertible behavior in elementary cellular automata with memory
• Randomized local search, evolutionary algorithms, and the minimum spanning tree problem
• Orderly algorithm to enumerate central groupoids and their graphs
• A novel image encryption algorithm using chaos and reversible cellular automata
• Error correcting codes via reversible cellular automata over finite fields
• A reversible steganography scheme of secret image sharing based on cellular automata and least significant bits construction
• Reversibility of general 1D linear cellular automata over the binary field \(\mathbb{Z}_2\) under null boundary conditions
• Procedures for calculating reversible one-dimensional cellular automata
• Efficient exhaustive listings of reversible one dimensional cellular automata
• Design of fast one-pass authenticated and randomized encryption schema using reversible cellular automata
• Local maps inducing surjective global maps of one-dimensional tessellation automata
• Representation of reversible cellular automata with block permutations
• Endomorphisms and automorphisms of the shift dynamical system
• Automata, Languages and Programming