Structure and properties of strong prefix codes of pictures

摘要

A set X ⊆ Σ∗∗ of pictures is a code if every picture over Σ is tilable in at most one way withrnpictures in X. The definition of strong prefix code is introduced. The family of finite strongrnprefix codes is decidable and it has a polynomial time decoding algorithm. Maximality forrnfinite strong prefix codes is also studied and related to the notion of completeness. We provernthat any finite strong prefix code can be embedded in a unique maximal strong prefix codernthat has minimal size and cardinality. A complete characterization of the structure ofrnmaximal finite strong prefix codes completes the paper.