Processing math: 0%

Christian Deppe ; Holger Schnettler - On the 3/4-Conjecture for Fix-Free Codes

dmtcs:3431 - Discrete Mathematics & Theoretical Computer Science, January 1, 2005, DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05) - https://doi.org/10.46298/dmtcs.3431
On the 3/4-Conjecture for Fix-Free CodesConference paper

Authors: Christian Deppe 1; Holger Schnettler 1

  • 1 Fakultät für Mathematik = Faculty of Mathematics [Bielefeld]

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.


Volume: DMTCS Proceedings vol. AE, European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
Section: Proceedings
Published on: January 1, 2005
Imported on: May 10, 2017
Keywords: Fix-free Codes,Kraft inequality,\frac{3 }{ 4}-conjecture,[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM],[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]

1 Document citing this article

Consultation statistics

This page has been seen 235 times.
This article's PDF has been downloaded 601 times.