Advertisement
Published in:
2015 | OriginalPaper | Chapter
Structure and Measure of a Decidable Class of Two-dimensional Codes
Authors : Marcella Anselmo, Dora Giammarresi, Maria Madonia
Published in: Language and Automata Theory and Applications
Publisher: Springer International Publishing
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
A two-dimensional code is defined as a set
$$X\subseteq \Sigma ^{**}$$
such that any picture over
$$\Sigma $$
is tilable in at most one way with pictures in
$$X$$
. It is in general undecidable whether a set
$$X$$
of pictures is a code also in the finite case. Very recently in [
3
] strong prefix picture codes were defined as a decidable subclass that generalizes prefix string codes. Here a characterization for strong prefix codes that results in an effective procedure to construct them is presented. As a consequence there are also proved interesting results on the measure of strong prefix codes and a connection with the family of string prefix codes.