On the 3/4-Conjecture for Fix-Free Codes - Archive ouverte HAL Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2005

On the 3/4-Conjecture for Fix-Free Codes

Abstract

In this paper we concern ourself with the question, whether there exists a fix-free code for a given sequence of codeword lengths. We focus mostly on results which shows the $\frac{3 }{ 4}$-conjecture for special kinds of lengths sequences.
Fichier principal
Vignette du fichier
dmAE0122.pdf (145.24 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01184388 , version 1 (14-08-2015)

Identifiers

Cite

Christian Deppe, Holger Schnettler. On the 3/4-Conjecture for Fix-Free Codes. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.111-116, ⟨10.46298/dmtcs.3431⟩. ⟨hal-01184388⟩

Collections

TDS-MACS
101 View
871 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More