Improved Upper Bound for the Redundancy of Fix-Free Codes
From MaRDI portal
Publication:3547853
DOI10.1109/TIT.2004.836703zbMATH Open1283.94032arXivcs/0408017OpenAlexW2166451469MaRDI QIDQ3547853FDOQ3547853
Authors: Sergey Yekhanin 
Publication date: 21 December 2008
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: 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.
Full work available at URL: https://arxiv.org/abs/cs/0408017
Cited In (2)
This page was built for publication: Improved Upper Bound for the Redundancy of Fix-Free Codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547853)
