A combinatorial approach to Golomb forests

Optimal binary prefix-free codes for infinite sources with geometrically distributed frequencies, e.g., P={p i(1−p)} i=0 ∞, 0<p<1 , were first (implicitly) suggested by Golomb over 30 years ago in the context of run-length encodings. Ten years later Gallager and Van Voorhis exhibited such opti...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science Jg. 263; H. 1; S. 283 - 304
1. Verfasser:	Golin, Mordecai J.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Amsterdam Elsevier B.V 2001 Elsevier
Schlagworte:	Combinatorics Combinatorics. Ordered structures Exact sciences and technology Graph theory Mathematics Sciences and techniques of general use Combinatorial method Optimal forest Tree(graph) Golomb forest Coding Probability distribution Graph theory Hoffman encoding problem Convergence
ISSN:	0304-3975, 1879-2294
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!