By Topic

Improved upper bound for the redundancy of fix-free codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
S. Yekhanin ; Dept. of Electr. Eng. & Comput. Sci., MIT, Cambridge, MA, USA

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.

Published in:

IEEE Transactions on Information Theory  (Volume:50 ,  Issue: 11 )