Improved Upper Bound for the Redundancy of Fix-Free Codes
Sergey Yekhanin
TL;DR
This paper establishes a new sufficient condition for the existence of fix-free codes and improves the upper bound on their redundancy, enhancing decoding robustness and efficiency.
Contribution
It introduces a novel sufficient condition for fix-free codes and tightens the upper bound on their redundancy, advancing coding theory.
Findings
New sufficient condition for fix-free code existence
Improved upper bound on redundancy of optimal fix-free codes
Enhanced decoding robustness and speed
Abstract
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · DNA and Biological Computing · Error Correcting Code Techniques