Encompression Using Two-dimensional Cellular Automata Rules
| dc.creator | Sahoo, Sudhakar | |
| dc.creator | Sahoo, Sanjaya | |
| dc.creator | Nayak, Birendra Kumar | |
| dc.creator | Choudhury, Pabitra Pal | |
| dc.date | 2008-08-11 | |
| dc.date.accessioned | 2026-07-07T09:55:58Z | |
| dc.date.available | 2026-07-07T09:55:58Z | |
| dc.description | In this paper, we analyze the algebraic structure of some null boundary as well as some periodic boundary 2-D Cellular Automata (CA) rules by introducing a new matrix multiplication operation using only AND, OR instead of most commonly used AND, EX-OR. This class includes any CA whose rule, when written as an algebra, is a finite Abelean cyclic group in case of periodic boundary and a finite commutative cyclic monoid in case of null boundary CA respectively. The concept of 1-D Multiple Attractor Cellular Automata (MACA) is extended to 2-D. Using the family of 2-D MACA and the finite Abelian cyclic group, an efficient encompression algorithm is proposed for binary images. | |
| dc.description | 5 pages, 4 figures | |
| dc.identifier | https://arxiv.org/abs/0808.1470 | |
| dc.identifier | http://arxiv.org/abs/0808.1470 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/166816 | |
| dc.subject | Discrete Mathematics | |
| dc.subject | Cryptography and Security | |
| dc.title | Encompression Using Two-dimensional Cellular Automata Rules | |
| dc.type | text |