Information: Join today and make your research activities more affordable! Technical workshop participation fees and annual registration fees are available at member rates.
Notice: [Important] Announcement of Changes to Registration Fee Payment and Manuscript Upload Procedures for IEICE Technical Meetings
IEICE Technical Committee Submission System
Conference Paper's Information		 Online Proceedings
[Sign in]
Tech. Rep. Archives
 Go Top Page Go Previous   [Japanese] / [English] 

Paper Abstract and Keywords
Presentation 2010-07-22 10:15
Data compression based on the Optimal Context Determined by the Minimal Expected Codeword Length in a Suffix Tree
Keita Tomokuni, Hirosuke Yamamoto (Univ. of Tokyo) IT2010-12
Abstract (in Japanese) (See Japanese page) 
(in English) In this paper, we consider a data compression method, which encodes each byte of data by using
a suffix tree. In the same way as PPM* and a dynamic anti-dictionary method based on a suffix tree, each byte is encoded by an arithmetic code using a suffix tree, which is constructed dynamically from the past data that has already been encoded. Two methods, threshold method and minimum-expected-codeword-length method, are proposed to select a context (or a suffix node) for encoding in a suffix tree.The performance of the proposed methods are compared with other methods for the Calgary Corpus, and it is shown that the minimum-expected-codeword-length method can achieve better compression rate than PPM* in the case of text files with large size.
Keyword (in Japanese) (See Japanese page) 
(in English) suffix tree / arithmetic coding / data compression / PPM / / / /  
Reference Info. IEICE Tech. Rep., vol. 110, no. 137, IT2010-12, pp. 7-12, July 2010.
Paper # IT2010-12 
Date of Issue 2010-07-15 (IT) 
ISSN Print edition: ISSN 0913-5685    Online edition: ISSN 2432-6380
Copyright
and
reproduction		 All rights are reserved and no part of this publication may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopy, recording, or any information storage and retrieval system, without permission in writing from the publisher. Notwithstanding, instructors are permitted to photocopy isolated articles for noncommercial classroom use without fee. (License No.: 10GA0019/12GB0052/13GB0056/17GB0034/18GB0034)
Download PDF IT2010-12

Conference Information
Committee IT  
Conference Date 2010-07-22 - 2010-07-23 
Place (in Japanese) (See Japanese page) 
Place (in English) Kogakuin University 
Topics (in Japanese) (See Japanese page) 
Topics (in English)  
Paper Information
Registration To IT 
Conference Code 2010-07-IT 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Data compression based on the Optimal Context Determined by the Minimal Expected Codeword Length in a Suffix Tree 
Sub Title (in English)  
Keyword(1) suffix tree  
Keyword(2) arithmetic coding  
Keyword(3) data compression  
Keyword(4) PPM  
Keyword(5)  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Keita Tomokuni  
1st Author's Affiliation The University of Tokyo (Univ. of Tokyo)
2nd Author's Name Hirosuke Yamamoto  
2nd Author's Affiliation The University of Tokyo (Univ. of Tokyo)
3rd Author's Name  
3rd Author's Affiliation ()
4th Author's Name  
4th Author's Affiliation ()
5th Author's Name  
5th Author's Affiliation ()
6th Author's Name  
6th Author's Affiliation ()
7th Author's Name  
7th Author's Affiliation ()
8th Author's Name  
8th Author's Affiliation ()
9th Author's Name  
9th Author's Affiliation ()
10th Author's Name  
10th Author's Affiliation ()
11th Author's Name  
11th Author's Affiliation ()
12th Author's Name  
12th Author's Affiliation ()
13th Author's Name  
13th Author's Affiliation ()
14th Author's Name  
14th Author's Affiliation ()
15th Author's Name  
15th Author's Affiliation ()
16th Author's Name  
16th Author's Affiliation ()
17th Author's Name  
17th Author's Affiliation ()
18th Author's Name  
18th Author's Affiliation ()
19th Author's Name  
19th Author's Affiliation ()
20th Author's Name  
20th Author's Affiliation ()
21st Author's Name  
21st Author's Affiliation ()
22nd Author's Name  
22nd Author's Affiliation ()
23rd Author's Name  
23rd Author's Affiliation ()
24th Author's Name  
24th Author's Affiliation ()
25th Author's Name  
25th Author's Affiliation ()
26th Author's Name / /
26th Author's Affiliation ()
()
27th Author's Name / /
27th Author's Affiliation ()
()
28th Author's Name / /
28th Author's Affiliation ()
()
29th Author's Name / /
29th Author's Affiliation ()
()
30th Author's Name / /
30th Author's Affiliation ()
()
31st Author's Name / /
31st Author's Affiliation ()
()
32nd Author's Name / /
32nd Author's Affiliation ()
()
33rd Author's Name / /
33rd Author's Affiliation ()
()
34th Author's Name / /
34th Author's Affiliation ()
()
35th Author's Name / /
35th Author's Affiliation ()
()
36th Author's Name / /
36th Author's Affiliation ()
()
Speaker Author-1 
Date Time 2010-07-22 10:15:00 
Presentation Time 25 minutes 
Registration for IT 
Paper # IT2010-12 
Volume (vol) vol.110 
Number (no) no.137 
Page pp.7-12 
#Pages 6 
Date of Issue 2010-07-15 (IT) 

[Return to Top Page]

[Return to IEICE Web Page]
The Institute of Electronics, Information and Communication Engineers (IEICE), Japan