Improved Upper Bound for the Redundancy of Fix-Free Codes
<|reference_start|>Improved Upper Bound for the Redundancy of Fix-Free Codes: A variable-length code is a fix-free code if no codeword is a prefix or a suffix of any other codeword. In a fix-free code any finite sequence of codewords can be decoded in both directions, which can improve the robustness to channel noise and speed up the decoding process. In this paper we prove a new sufficient condition of the existence of fix-free codes and improve the upper bound on the redundancy of optimal fix-free codes.<|reference_end|>
@article{yekhanin2004improved,
    title={Improved Upper Bound for the Redundancy of Fix-Free Codes},
    author={Sergey Yekhanin},
    journal={arXiv preprint arXiv:cs/0408017},
    year={2004},
    archivePrefix={arXiv},
    eprint={cs/0408017},
    primaryClass={cs.IT math.IT}
}