Title :
Some notes on fix-free codes
Author :
Kakhbod, Ali ; Nazari, Ali ; Zadimoghaddam, Morteza
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., Michigan Univ., Ann Arbor, MI
Abstract :
A variable-length code is called a fix-free code if it is both prefix-free and suffix-free. In this paper, we consider some basic properties of fix-free codes. We obtain one lower and one upper bound on the redundancy of the optimal fix-free code. Comparing these bounds, we derive an upper bound on the length of the most likely source symbol in terms of its probability.
Keywords :
probability; variable length codes; fix-free codes; prefix-free; source symbol; suffix-free; variable-length code; Code standards; Decoding; Entropy; Length measurement; MPEG 4 Standard; Noise robustness; Probability distribution; Standards development; Upper bound; Video compression; Fix-free code; Prefix-free; Redundancy; Suffix-free;
Conference_Titel :
Information Sciences and Systems, 2008. CISS 2008. 42nd Annual Conference on
Conference_Location :
Princeton, NJ
Print_ISBN :
978-1-4244-2246-3
Electronic_ISBN :
978-1-4244-2247-0
DOI :
10.1109/CISS.2008.4558667
