| Autor: |
ANSELMO, MARCELLA, GIAMMARRESI, DORA, MADONIA, MARIA |
| Předmět: |
|
| Zdroj: |
International Journal of Foundations of Computer Science; Dec2014, Vol. 25 Issue 8, p1017-1031, 15p |
| Abstrakt: |
A two-dimensional code of pictures is defined as a set X ⊆ Σ** such that any picture over Σ is tilable in at most one way with pictures in X. It is proved that in general it is undecidable whether a finite set of picture is a code. The subclass of prefix codes is introduced and it is proved that it is decidable whether a finite set of pictures is a prefix code. Further a polynomial time decoding algorithm for finite prefix codes is given. Maximality and completeness of finite prefix codes are studied. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
