Presentation 2007-03-16
Updating algorithms for Jones splay code with a multiway tree
Yoshiyuki SUIMON, Hirosuke YAMAMOTO,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The splay code is a data compression code such that the code tree is dynamically updated to halve the depth of the leaf of such encoded symbol. In the case of a binary code tree, it is updated by exchanging the occurred leaf (or node) for the sibling of the parent node repeatedly from a leaf to the root. But, in the case of a multiway code tree, we have a flexibility to select which sibling should be exchanged. In this paper, we consider several algorithms to give a priority order to sibling nodes, and we clarify by simulation what kind of rule to give the priority order can attain a high compression.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Splay code / Splay tree / Jones code / Data compression / Dynamic coding
Paper # IT2006-118,ISEC2006-173,WBS2006-115
Date of Issue

Conference Information
Committee ISEC
Conference Date 2007/3/9(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) Updating algorithms for Jones splay code with a multiway tree
Sub Title (in English)
Keyword(1) Splay code
Keyword(2) Splay tree
Keyword(3) Jones code
Keyword(4) Data compression
Keyword(5) Dynamic coding
1st Author's Name Yoshiyuki SUIMON
1st Author's Affiliation Graduate School of Frontier Sciences, The University of Tokyo()
2nd Author's Name Hirosuke YAMAMOTO
2nd Author's Affiliation Graduate School of Frontier Sciences, The University of Tokyo
Date 2007-03-16
Paper # IT2006-118,ISEC2006-173,WBS2006-115
Volume (vol) vol.106
Number (no) 597
Page pp.pp.-
#Pages 6
Date of Issue