Complete variable-length ``fix-free codes
From MaRDI portal
Complete variable-length ``fix-free'' codes
A set of codewords is said to be fix-free if it is both prefix-free and suffix-free. A set of codewords \(\{x_ 1, x_ 2, \dots, x_ n\}\) over a \(t\)-letter alphabet \(\Sigma\) is said to be complete if it satisfies the equality \(\sum_{1\leq i\leq n} t^{-| x_ i|} =1\) (the Kraft inequality with equality). The authors give a construction of a complete fix-free code that gives a ratio of the longest word to the shortest word approaching 3. They further generalize this by developing a recursive construction which gives arbitrarily large ratios.
Recommendations
- Some basic properties of fix-free codes
- On the construction of prefix-free and fix-free codes with specified codeword compositions
- Multiplied complete fix-free codes and shiftings regarding the 3/4-conjecture
- Sufficient Conditions for Existence of Binary Fix-Free Codes
- On the 3/4-conjecture for fix-free codes
Cited in
(11)- Sufficient Conditions for Existence of Binary Fix-Free Codes
- On the 3/4-conjecture for fix-free codes
- A universal variable-to-fixed length source code based on Lawrence's algorithm
- scientific article; zbMATH DE number 176765 (Why is no real title available?)
- Some basic properties of fix-free codes
- Variable-length integer codes based on the Goldbach conjecture, and other additive codes
- Multiplied complete fix-free codes and shiftings regarding the 3/4-conjecture
- The existence and synchronization properties of symmetric fix-free codes
- On the construction of prefix-free and fix-free codes with specified codeword compositions
- Complete variable-length codes: an excursion into word edit operations
- Variable-length coding of two-sided asymptotically mean stationary measures
This page was built for publication: Complete variable-length ``fix-free codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1345134)
