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. The family of finite strong prefix codes is decidable and it has a polynomial time decoding algorithm. Maximality for finite strong prefix codes is also studied and related to the notion of completeness. We prove that any finite strong prefix code can be embedded in a unique maximal strong prefix code that has minimal size and cardinality. A complete characterization of the structure of maximal finite strong prefix codes completes the paper.
|Titolo:||Structure and properties of strong prefix codes of pictures|
|Data di pubblicazione:||2017|
|Appare nelle tipologie:||1.1 Articoli su Rivista|