Tiling with polyominoes under modular arithmetic and distance criteria

Abstract

We present a two steps procedure for tiling with polyominoes a given finite region consisting of cells in a regular lattice in /spl Rscr//sup 2/ under modular arithmetic and distance criteria. As a consequence, a very effective procedure to combat cluster of errors by use of single or multiple error-correcting codes is proposed.<>