Abstract
Presented is the idea of the congruence of binary gaskets generated using modular arithmetic operations on a parent array. It is seen that the binary gaskets of prime orders are nontrivial, while the binary gaskets of nonprime orders are congruences.
Original language | English (US) |
---|---|
Pages (from-to) | 613-617 |
Number of pages | 5 |
Journal | Computers and Graphics |
Volume | 17 |
Issue number | 5 |
DOIs | |
State | Published - 1993 |
All Science Journal Classification (ASJC) codes
- Software
- General Engineering
- Signal Processing
- Human-Computer Interaction
- Computer Vision and Pattern Recognition
- Computer Graphics and Computer-Aided Design