| Presentation | 2021-03-04 A note on sufficient condition for reconstructable substring of CSE method Shungo Tanaka, Hiroshi Kamabe, Shan Lu, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Various data compression methods have been proposed, which can be roughly classified into two cat-egories: lossless compression methods that can completely recover the original data from compressed data andirreversible compression methods that cannot completely recover the original data. In this study, we focus on acompression method called Compression via Substring Enumeration (CSE) , which is a kind of lossless compressionmethod proposed by Dub? et al. In the CSE method, encoding is performed by counting the number of occurrencesof substrings in the string to be compressed. In one improvement of CSE by Shima et al. , it was shown thatby improving the conditional expression of the substring counting, the compression ratio is better than that of theCSE method proposed by Dub? et al. for some random information sources. In this study, the number of substringsto be encoded is reduced by creating a graph structure called CST when counting the number of occurrences ofsubstrings, conducting a full search from the root of the CST each time a node is created, and terminating the en-coding when a string of length n is found. The number of substrings to be encoded is reduced, and the compressionratio is improved by Huffman coding. Besides, we evaluate the coding rate by comparing the proposed method withexisting methods. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Compression via Substring Enumeration / Substring enumeration / compression ratio |
| Paper # | IT2020-116,ISEC2020-46,WBS2020-35 |
| Date of Issue | 2021-02-25 (IT, ISEC, WBS) |
| Conference Information | |
| Committee | WBS / IT / ISEC |
|---|---|
| Conference Date | 2021/3/4(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Online |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | Joint Meeting of WBS, IT, and ISEC |
| Chair | Masanori Hamamura(Kochi Univ. of Tech.) / Tadashi Wadayama(Nagoya Inst. of Tech.) / Shoichi Hirose(Univ. of Fukui) |
| Vice Chair | Takashi Shono(INTEL) / Masahiro Fujii(Utsunomiya Univ.) / Tetsuya Kojima(Tokyo Kosen) / Tetsuya Izu(Fujitsu Labs.) / Noboru Kunihiro(Tsukuba Univ.) |
| Secretary | Takashi Shono(Okayama Univ. of Science) / Masahiro Fujii(National Defence Academy) / Tetsuya Kojima(Yamaguchi Univ.) / Tetsuya Izu(Saga Univ.) / Noboru Kunihiro(Tsukuba Univ.) |
| Assistant | Duong Quang Thang(NAIST) / Masafumi Moriyama(NICT) / Masayuki Kinoshita(Chiba Univ. of Tech.) / Takahiro Ohta(Senshu Univ.) / Kazuki Yoneyama(Ibaraki Univ.) |
| Paper Information | |
| Registration To | Technical Committee on Wideband System / Technical Committee on Information Theory / Technical Committee on Information Security |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | A note on sufficient condition for reconstructable substring of CSE method |
| Sub Title (in English) | |
| Keyword(1) | Compression via Substring Enumeration |
| Keyword(2) | Substring enumeration |
| Keyword(3) | compression ratio |
| 1st Author's Name | Shungo Tanaka |
| 1st Author's Affiliation | Gifu University(Gifu Univ.) |
| 2nd Author's Name | Hiroshi Kamabe |
| 2nd Author's Affiliation | Gifu University(Gifu Univ.) |
| 3rd Author's Name | Shan Lu |
| 3rd Author's Affiliation | Gifu University(Gifu Univ.) |
| Date | 2021-03-04 |
| Paper # | IT2020-116,ISEC2020-46,WBS2020-35 |
| Volume (vol) | vol.120 |
| Number (no) | IT-410,ISEC-411,WBS-412 |
| Page | pp.pp.25-30(IT), pp.25-30(ISEC), pp.25-30(WBS), |
| #Pages | 6 |
| Date of Issue | 2021-02-25 (IT, ISEC, WBS) |