DocumentCode
1027615
Title
Almost asymptotically optimal flag encoding of the integers
Author
Wang, Muzhong
Author_Institution
ETH, Zurich, Switzerland
Volume
34
Issue
2
fYear
1988
fDate
3/1/1988 12:00:00 AM
Firstpage
324
Lastpage
326
Abstract
A simple prefix-free encoding scheme for the positive integers is proposed in which a flag of f zeros is used to mark the end of a codeword, and bit stuffing is used to prevent premature appearance of the flag in the conventional binary coding of the integers. It is shown that this coding scheme is universal in the sense defined by P. Elias (1975) and that for large f its asymptotic efficiency is virtually 1
Keywords
encoding; asymptotic efficiency; asymptotically optimal flag encoding; bit stuffing; codeword; positive integers; prefix-free encoding scheme; Decoding; Electrons; Encoding; Game theory; Gaussian noise; Jamming; Memoryless systems; Probability distribution; Robustness; Signal processing;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.2643
Filename
2643
Link To Document