Complete variable-length ``fix-free'' codes (Q1345134): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Method for the Construction of Minimum-Redundancy Codes / rank | |||
Normal rank |
Revision as of 12:08, 23 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Complete variable-length ``fix-free'' codes |
scientific article |
Statements
Complete variable-length ``fix-free'' codes (English)
0 references
26 February 1995
0 references
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.
0 references
construction of complete fix-free code
0 references
ratios
0 references