Improved Upper Bound for the Redundancy of Fix-Free Codes

Details Improved Upper Bound for the Redundancy of Fix-Free Codes Improved Upper Bound for the Redundancy of Fix-Free Codes

2004-08-05

arxiv.org/abs/cs/0408017v1

Computer Science

Information Theory

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Improved Upper Bound for the Redundancy of Fix-Free Codes does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Improved Upper Bound for the Redundancy of Fix-Free Codes, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improved Upper Bound for the Redundancy of Fix-Free Codes will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-500768