| 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 | 2011-03-04 09:25 A Practical Algorithm of Universal Source Coding by the Most Frequent Substring Tsuki Saito, Tetsunao Matsuta, Ryutaroh Matsumoto, Tomohiko Uyematsu (Tokyo Inst. of Tech)  IT2010-105 ISEC2010-109 WBS2010-84 |
|
| Abstract | (in Japanese) | (See Japanese page) |
| (in English) | In the grammar based code proposed by Kieffer and Yang, a context-free grammar which only produces the input sequence is constructed, and the obtained grammar is encoded into a binary sequence. Lin et al. proposed a grammar based code by using the most frequent substring. Their proposed code is based on the reduction of the string which appears most frequently in the sequence. Lin et al. also proved that their code is a universal code whose average length converges to the entropy rate of the source as the length of the input sequence tends to infinity. However, it is not clear whether the grammar transformation proposed by Lin et al. can be executed in practical computational complexity. In this paper, we propose a new grammar based code by using the most frequent substring. We prove that the proposed code is a universal code, and that the proposed grammar transformation can be executed in $O(n^2)$ for the length of the input sequence $n$. | |
| Keyword | (in Japanese) | (See Japanese page) |
| (in English) | grammar based codes / most frequent substring / source coding / stationary source / universal code / / / | |
| Reference Info. | IEICE Tech. Rep., vol. 110, no. 442, IT2010-105, pp. 243-248, March 2011. | |
| Paper # | IT2010-105 | |
| Date of Issue | 2011-02-24 (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 | IT2010-105 ISEC2010-109 WBS2010-84 |
|
| Conference Information | |
| Committee | ISEC IT WBS |
| Conference Date | 2011-03-03 - 2011-03-04 |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Osaka University |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Paper Information | |
| Registration To | IT |
| Conference Code | 2011-03-ISEC-IT-WBS |
| Language | Japanese |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | A Practical Algorithm of Universal Source Coding by the Most Frequent Substring |
| Sub Title (in English) | |
| Keyword(1) | grammar based codes |
| Keyword(2) | most frequent substring |
| Keyword(3) | source coding |
| Keyword(4) | stationary source |
| Keyword(5) | universal code |
| Keyword(6) | |
| Keyword(7) | |
| Keyword(8) | |
| 1st Author's Name | Tsuki Saito |
| 1st Author's Affiliation | Tokyo Institute of Technology (Tokyo Inst. of Tech) |
| 2nd Author's Name | Tetsunao Matsuta |
| 2nd Author's Affiliation | Tokyo Institute of Technology (Tokyo Inst. of Tech) |
| 3rd Author's Name | Ryutaroh Matsumoto |
| 3rd Author's Affiliation | Tokyo Institute of Technology (Tokyo Inst. of Tech) |
| 4th Author's Name | Tomohiko Uyematsu |
| 4th Author's Affiliation | Tokyo Institute of Technology (Tokyo Inst. of Tech) |
| 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 | () |
| Speaker | Author-1 |
| Date Time | 2011-03-04 09:25:00 |
| Presentation Time | 25 minutes |
| Registration for | IT |
| Paper # | IT2010-105, ISEC2010-109, WBS2010-84 |
| Volume (vol) | vol.110 |
| Number (no) | no.442(IT), no.443(ISEC), no.444(WBS) |
| Page | pp.243-248 |
| #Pages | 6 |
| Date of Issue | 2011-02-24 (IT, ISEC, WBS) |
[Return to Top Page]