Hostname: page-component-7b7567c8c-tnkh4 Total loading time: 0 Render date: 2026-11-17T02:18:43.528Z Has data issue: false hasContentIssue false

Structure and properties of strong prefix codes of pictures

Published online by Cambridge University Press:  28 May 2015

MARCELLA ANSELMO
Affiliation:
Dipartimento di Informatica, Università di Salerno, Via Giovanni Paolo II 132, 84084 Fisciano (SA), Italy Email: anselmo@dia.unisa.it
DORA GIAMMARRESI
Affiliation:
Dipartimento di Matematica, Università di Roma ‘Tor Vergata,’ Via della Ricerca Scientifica, 00133 Roma, Italy Email: giammarr@mat.uniroma2.it
MARIA MADONIA
Affiliation:
Dipartimento di Matematica e Informatica, Università di Catania, Viale Andrea Doria 6/a, 95125 Catania, Italy Email: madonia@dmi.unict.it
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Paper
Copyright
Copyright © Cambridge University Press 2015