DocumentCode
2001719
Title
Improved upper bound for the redundancy of fix-free codes
Author
Yekhanin, Sergey
Author_Institution
Dept. of Electr. Eng. & Comput. Sci., Massachusetts Inst. of Technol., Cambridge, MA, USA
fYear
2003
fDate
29 June-4 July 2003
Firstpage
80
Abstract
A variable-length code is a fix-free code if no codeword is a prefix or a suffix of any other codeword. In fix-free code any finite sequence of codewords can be decoded in both directions, which can improve robustness to channel noise and speed up the decoding process. In this paper we prove a new sufficient condition for existence of fix-free codes and improve upper bound on the redundancy of optimal fix-free codes.
Keywords
noise; variable length codes; channel noise; codeword finite sequence; fix-free code; robustness improvement; variable-length code; Codes; Combinatorial mathematics; Cryptography; Decoding; Entropy; Noise robustness; Probability distribution; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2003. Proceedings. IEEE International Symposium on
Print_ISBN
0-7803-7728-1
Type
conf
DOI
10.1109/ISIT.2003.1228094
Filename
1228094
Link To Document