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 2013-03-07 13:40
Maximum Redundancy of Lossless Data Compression via Substring Enumeration for Markov Sources
Ken-ichi Iwata (Univ. of Fukui), Mitsuharu Arimura (Shonan Inst. Tech.), Yuki Shima (Univ. of Fukui) IT2012-76 ISEC2012-94 WBS2012-62
Abstract (in Japanese) (See Japanese page) 
(in English) Dub\'{e} and Beaudoin proposed a technique of lossless data compression called compression via substring enumeration (CSE) in 2010. This paper evaluates an upper bound of the amount of bits used by the CSE technique to encode any individual string from an unknown member of a known class of $k$-th order Markov processes. We compare the worst case maximum redundancy obtained by the CSE technique for any binary string with the least possible value of the worst case maximum redundancy obtained by the best fixed-to-variable length code satisfying the Kraft inequality. We clarify that the difference of the worst case maximum redundancies is at most $\log_2 n$+constant, where $n$ denotes the length of a binary string to be encoded.
Keyword (in Japanese) (See Japanese page) 
(in English) lossless data compression / universal source coding / compression via substring enumeration / k-th order Markov sources / maximum redundancy / / /  
Reference Info. IEICE Tech. Rep., vol. 112, no. 460, IT2012-76, pp. 95-100, March 2013.
Paper # IT2012-76 
Date of Issue 2013-02-28 (IT, ISEC, WBS) 
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 IT2012-76 ISEC2012-94 WBS2012-62

Conference Information
Committee IT ISEC WBS  
Conference Date 2013-03-07 - 2013-03-08 
Place (in Japanese) (See Japanese page) 
Place (in English) Kwansei Gakuin Univ., Osaka-Umeda Campus 
Topics (in Japanese) (See Japanese page) 
Topics (in English) joint meeting of IT, ISEC, and WBS 
Paper Information
Registration To IT 
Conference Code 2013-03-IT-ISEC-WBS 
Language Japanese 
Title (in Japanese) (See Japanese page) 
Sub Title (in Japanese) (See Japanese page) 
Title (in English) Maximum Redundancy of Lossless Data Compression via Substring Enumeration for Markov Sources 
Sub Title (in English)  
Keyword(1) lossless data compression  
Keyword(2) universal source coding  
Keyword(3) compression via substring enumeration  
Keyword(4) k-th order Markov sources  
Keyword(5) maximum redundancy  
Keyword(6)  
Keyword(7)  
Keyword(8)  
1st Author's Name Ken-ichi Iwata  
1st Author's Affiliation University of Fukui (Univ. of Fukui)
2nd Author's Name Mitsuharu Arimura  
2nd Author's Affiliation Shonan Institute of Technology (Shonan Inst. Tech.)
3rd Author's Name Yuki Shima  
3rd Author's Affiliation University of Fukui (Univ. of Fukui)
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 2013-03-07 13:40:00 
Presentation Time 25 minutes 
Registration for IT 
Paper # IT2012-76, ISEC2012-94, WBS2012-62 
Volume (vol) vol.112 
Number (no) no.460(IT), no.461(ISEC), no.462(WBS) 
Page pp.95-100 
#Pages 6 
Date of Issue 2013-02-28 (IT, ISEC, WBS) 

[Return to Top Page]

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