DocumentCode
1443010
Title
Some basic properties of fix-free codes
Author
Ye, Chunxuan ; Yeung, Raymond W.
Author_Institution
Dept. of Inf. Eng., Chinese Univ. of Hong Kong, Shatin, China
Volume
47
Issue
1
fYear
2001
fDate
1/1/2001 12:00:00 AM
Firstpage
72
Lastpage
87
Abstract
A variable-length code is a fix-free code if no codeword is a prefix or a suffix of any other codeword. This class of codes is applied to speed up the decoding process, for the decoder can decode from both sides of the compressed file simultaneously. We study some basic properties of fix-free codes. We prove a sufficient and a necessary condition for the existence of fix-free codes, and we obtain some new upper bounds on the redundancy of optimal fix-free codes
Keywords
binary codes; decoding; probability; variable length codes; Kraft inequality; binary fix-free codes; codeword; compressed file; decoder; decoding; necessary condition; optimal fix-free codes; probabilistic method; redundancy; sufficient condition; upper bounds; variable-length code; Conferences; Decoding; Entropy; Information theory; Probability distribution; Source coding; Sufficient conditions; Upper bound;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.904513
Filename
904513
Link To Document