Encompression Using Two-dimensional Cellular Automata Rules

Details Encompression Using Two-dimensional Cellular Automata Rules Encompression Using Two-dimensional Cellular Automata Rules

2008-08-11

arxiv.org/abs/0808.1470v1

Computer Science

Discrete Mathematics

5 pages, 4 figures

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Encompression Using Two-dimensional Cellular Automata Rules does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Encompression Using Two-dimensional Cellular Automata Rules, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Encompression Using Two-dimensional Cellular Automata Rules will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-492877