Presentation 2001/3/16
The condition for Huffman code to be competitively optimal
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 competitively optimal if it competitively dominates any other FV codeS. The competitively optimal code, however, does not always exist for a given source probability distribution. On the other hand, it is known that Huffman code is always competitively optimal within one bit and that if the competitively optimal code exists, it is Huffman code. In this paper, by introducing a new index for competitive dominance we derive the necessary and sufficient condition to judge the competitive optimality of the Huffman code.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Huffman code / competitively optimal code
Paper # IT2000-78,ISEC2000-132,SST2000-162,ITS2000-87
Date of Issue

Conference Information
Committee ISEC
Conference Date 2001/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) The condition for Huffman code to be competitively optimal
Sub Title (in English)
Keyword(1) Huffman code
Keyword(2) competitively optimal code
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 2001/3/16
Paper # IT2000-78,ISEC2000-132,SST2000-162,ITS2000-87
Volume (vol) vol.100
Number (no) 692
Page pp.pp.-
#Pages 6
Date of Issue