Title :
Improved upper bound for the redundancy of fix-free codes
Author :
Yekhanin, Sergey
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., MIT, Cambridge, MA, USA
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.
Keywords :
binary sequences; decoding; optimisation; redundancy; variable length codes; channel noise robustness; decoding; finite codeword sequence; optimal fix-free codes; redundancy; speed up; upper bound; variable-length code; Decoding; Entropy; Noise robustness; Probability distribution; Source coding; Sufficient conditions; Upper bound; Fix-free code; redundancy;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.2004.836703
