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.
Origin | Publisher files allowed on an open archive |
---|
Loading...