Abstract
A set X ⊆ ∑** of pictures is a code if every picture over ∑ is tilable in at most one way with pictures in X. The definition of strong prefix code is introduced and it is proved that the corresponding family of finite strong prefix codes is decidable and it has a polynomial time decoding algorithm. Maximality for finite strong prefix codes is also considered. Given a strong prefix code, it is proved that there exists a unique maximal strong prefix code that contains it and that has a minimal size. The notion of completeness is also investigated in relation to maximality. © 2013 Springer-Verlag.
Cite
CITATION STYLE
Anselmo, M., Giammarresi, D., & Madonia, M. (2013). Strong prefix codes of pictures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8080 LNCS, pp. 47–59). https://doi.org/10.1007/978-3-642-40663-8_6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
