Presentation 2000/3/16
Competitive Optimality of Alphabetic Codes
Go Maruyama, Hirosuke Yamamoto,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) A FV code is called an alphabetic code if its codewords satisfy the same order as source symbols. The averagely optimal alphabetic code that attains the minimum average codeword length can be obtained by Hu-Tucker algorithm, Garsia-Wachs algorithm, etc. However, the competitively optimal alphabetic code has not been studied yet. In this paper, the competitive optimality is considered for alphabetic codes, and the following are proved. (1)The competitively optimal alphabetic code does not always exist for a given source probability distribution. (2)In the case that the competitively optimal alphabetic code exists, it is also averagely optimal.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) alphabetic code / averagely optimal code / competitively optimal code / lmcp.
Paper # IT99-72,ISEC99-111,SST99-120
Date of Issue

Conference Information
Committee ISEC
Conference Date 2000/3/16(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Information Security (ISEC)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Competitive Optimality of Alphabetic Codes
Sub Title (in English)
Keyword(1) alphabetic code
Keyword(2) averagely optimal code
Keyword(3) competitively optimal code
Keyword(4) lmcp.
1st Author's Name Go Maruyama
1st Author's Affiliation Department of Mathematical Engineering and Information Physics, University of Tokyo()
2nd Author's Name Hirosuke Yamamoto
2nd Author's Affiliation Department of Mathematical Engineering and Information Physics, University of Tokyo
Date 2000/3/16
Paper # IT99-72,ISEC99-111,SST99-120
Volume (vol) vol.99
Number (no) 701
Page pp.pp.-
#Pages 6
Date of Issue