Improved Upper Bound for the Redundancy of Fix-Free Codes

Simple item page
dc.creatorYekhanin, Sergey
dc.date2004-08-05
dc.date.accessioned2026-07-07T08:15:14Z
dc.date.available2026-07-07T08:15:14Z
dc.descriptionA 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.
dc.identifierhttps://arxiv.org/abs/cs/0408017
dc.identifierhttp://arxiv.org/abs/cs/0408017
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/133385
dc.subjectInformation Theory
dc.titleImproved Upper Bound for the Redundancy of Fix-Free Codes
dc.typetext

Files

Collections

arXiv