DocumentCode
1098578
Title
A new asymptotically optimal code for the positive integers
Author
Yamamoto, Hirosuke ; Ochi, Hiroshi
Author_Institution
Inf. Syst. Lab., Stanford Univ., CA, USA
Volume
37
Issue
5
fYear
1991
fDate
9/1/1991 12:00:00 AM
Firstpage
1420
Lastpage
1429
Abstract
A new universal binary code for the positive integers is proposed as a modified version of M. Wang´s (see ibid., vol.34, p.324-6, Mar. 1988) flag encoding scheme. The codeword length of the new scheme is shorter than Wang´s, on an average, for large initial segments of the positive integers. The performance of the new scheme is also compared with that of other universal schemes. Furthermore, it is shown that an asymptotically optimal code can be achieved by modifying the new flag scheme such that the flag length varies dynamically
Keywords
codes; data compression; encoding; asymptotically optimal code; data compression; flag encoding scheme; positive integers; universal binary code; Block codes; Broadcasting; Error correction codes; Gas insulated transmission lines; IEEE Press; Linear code; Notice of Violation; Protection; Size control; Welding;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/18.133261
Filename
133261
Link To Document