Reversibility of Symmetric Linear Cellular Automata with Radius r = 3
The aim of this work is to completely solve the reversibility problem for symmetric linear cellular automata with radius r = 3 and null boundary conditions. The main result obtained is the explicit computation of the local transition functions of the inverse cellular automata. This allows introducti...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2019 |
| País: | España |
| Institución: | Universidad de Burgos (UBU) |
| Repositorio: | Repositorio Institucional de la Universidad de Burgos (RIUBU) |
| OAI Identifier: | oai:riubu.ubu.es:10259/7256 |
| Acceso en línea: | http://hdl.handle.net/10259/7256 |
| Access Level: | acceso abierto |
| Palabra clave: | Linear cellular automata Reversibility Symmetric rules Informática Computer science |
| Sumario: | The aim of this work is to completely solve the reversibility problem for symmetric linear cellular automata with radius r = 3 and null boundary conditions. The main result obtained is the explicit computation of the local transition functions of the inverse cellular automata. This allows introduction of possible and interesting applications in digital image encryption. |
|---|