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 2009-07-24 11:20
A New Data Compression Algorithm Based on a Dictionary Method Using Recursive Construction of T-codes
Kenji Hamano, Hirosuke Yamamoto (Tokyo Univ.) IT2009-20
Abstract (in Japanese) (See Japanese page) 
(in English) We present a new data compression algorithm based on a dictionary method using the recursive construction of T-codes.
For all files in Calgary corpus, this data compression algorithm achieves better compression ratio than the ``compress" command, which is an implementation of the LZW algorithm classified as the LZ78 family.
The NIST SP 800-22, which is the most widely used statistical test suit for random numbers in the field of cryptography, originally included the Lempel-Ziv compression test based on the LZ-complexity derived from the LZ78 incremental parsing rule, but then removed it because its P-value distributes discretely. Now the NIST SP 800-22 has no randomness test to directly measure the compressibility of sequences.
To solve this problem, we proposed a randomness test based on T-codes in 2008. The T-complexity used in this test is derived from the string parsing algorithm called T-decomposition, by which the string can be represented as a T-code codeword. Realization of a data compression algorithm based on the recursive construction of T-codes supports that the randomness test based on T-codes can replace the Lempel-Ziv compression test included in the NIST SP 800-22.
Keyword (in Japanese) (See Japanese page) 
(in English) T-code / T-complexity / data compression / Lempel-Ziv / LZ-complexity / NIST SP 800-22 / /  
Reference Info. IEICE Tech. Rep., vol. 109, no. 143, IT2009-20, pp. 85-90, July 2009.
Paper # IT2009-20 
Date of Issue 2009-07-16 (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 IT2009-20

Conference Information
Committee IT  
Conference Date 2009-07-23 - 2009-07-24 
Place (in Japanese) (See Japanese page) 
Place (in English) Kwansei Gakuin Univ. (Umeda campus) 
Topics (in Japanese) (See Japanese page) 
Topics (in English) Freshman session, general 
Paper Information
Registration To IT 
Conference Code 2009-07-IT 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) A New Data Compression Algorithm Based on a Dictionary Method Using Recursive Construction of T-codes 
Sub Title (in English)  
Keyword(1) T-code  
Keyword(2) T-complexity  
Keyword(3) data compression  
Keyword(4) Lempel-Ziv  
Keyword(5) LZ-complexity  
Keyword(6) NIST SP 800-22  
Keyword(7)  
Keyword(8)  
1st Author's Name Kenji Hamano  
1st Author's Affiliation The University of Tokyo (Tokyo Univ.)
2nd Author's Name Hirosuke Yamamoto  
2nd Author's Affiliation The University of Tokyo (Tokyo Univ.)
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 2009-07-24 11:20:00 
Presentation Time 25 minutes 
Registration for IT 
Paper # IT2009-20 
Volume (vol) vol.109 
Number (no) no.143 
Page pp.85-90 
#Pages 6 
Date of Issue 2009-07-16 (IT) 

[Return to Top Page]

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