Presentation 2006-03-16
Data Compression Using Source Model Based on Antidictionary Tree
Takahiro OTA, Hiroyoshi MORITA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Data compression method using source model based on the automaton used antidictionary coding is proposed. However, the automaton is constructing to comparison words of antidictionary efficiently and therefore it is not sufficient to represent source model of a given text. In this paper, we present a fast and memory-efficient algorithm to give a better source model called antidictionay tree and its effectiveness is demonstrated.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Antidictionary / Lossless compression / Arithmetic coding / Suffix tree / Source coding
Paper # IT2005-87,ISEC2005-144,WBS2005-101
Date of Issue

Conference Information
Committee ISEC
Conference Date 2006/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) Data Compression Using Source Model Based on Antidictionary Tree
Sub Title (in English)
Keyword(1) Antidictionary
Keyword(2) Lossless compression
Keyword(3) Arithmetic coding
Keyword(4) Suffix tree
Keyword(5) Source coding
1st Author's Name Takahiro OTA
1st Author's Affiliation Department of Electronic Engineering, Nagano Prefectural Institute of Technology()
2nd Author's Name Hiroyoshi MORITA
2nd Author's Affiliation Graduate School of Information Systems, University of Electro-Communications
Date 2006-03-16
Paper # IT2005-87,ISEC2005-144,WBS2005-101
Volume (vol) vol.105
Number (no) 663
Page pp.pp.-
#Pages 6
Date of Issue