Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

29

CORR
2004
Springer

favoriteEmaildiscussreport

76views Education» more CORR 2004»

Improved Upper Bound for the Redundancy of Fix-Free Codes

13 years 10 months ago

Improved Upper Bound for the Redundancy of Fix-Free Codes

Download research.microsoft.com

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.

Sergey Yekhanin

Real-time Traffic

Codewords | CORR 2004 | Education | Fix-free Codes | Variable-length Code |

claim paper

Related Content

» RedundancyRelated Bounds for Generalized Huffman Codes

» Improved Probabilistic Bounds on Stopping Redundancy

» Improved upper bounds on sizes of codes

» A Lower Bound on the Redundancy of ArithmeticType Delay Constrained Coding

» Bounds on Redundancy in Constrained Delay Arithmetic Coding

» Tight Bounds on Minimum Maximum Pointwise Redundancy

» An Improved Bound on the List Error Probability and List Distance Properties

» On the Size of Monotone Span Programs

» Locally Testable Codes Require Redundant Testers

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2004
Where	CORR
Authors	Sergey Yekhanin

Comments (0)