Abstract
A two-dimensional code is defined as a set X ⊆ ∑** such that any picture over ∑ is tilable in at most one way with pictures in X. The codicity problem is undecidable. 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: differently from the one-dimensional case, they are not equivalent notions. Completeness of finite prefix codes is characterized. © 2013 Springer-Verlag.
Cite
CITATION STYLE
Anselmo, M., Giammarresi, D., & Madonia, M. (2013). Two dimensional prefix codes of pictures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7907 LNCS, pp. 46–57). https://doi.org/10.1007/978-3-642-38771-5_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
