Keyword : lossless data compression


Compression by Substring Enumeration Using Sorted Contingency Tables
Takahiro OTA Hiroyoshi MORITA Akiko MANADA 
Publication:   
Publication Date: 2020/06/01
Vol. E103-A  No. 6 ; pp. 829-835
Type of Manuscript:  PAPER
Category: Information Theory
Keyword: 
CSEsortingcontingency tablelossless data compression
 Summary | Full Text:PDF

A Variable-to-Fixed Length Lossless Source Code Attaining Better Performance than Tunstall Code in Several Criterions
Mitsuharu ARIMURA 
Publication:   
Publication Date: 2018/01/01
Vol. E101-A  No. 1 ; pp. 249-258
Type of Manuscript:  PAPER
Category: Information Theory
Keyword: 
lossless data compressionsource codingvariable-to-fixed length codeTunstall codeaverage pointwise coding rateworst-case coding rate
 Summary | Full Text:PDF

Average Coding Rate of a Multi-Shot Tunstall Code with an Arbitrary Parsing Tree Sequence
Mitsuharu ARIMURA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2016/12/01
Vol. E99-A  No. 12 ; pp. 2281-2285
Type of Manuscript:  Special Section LETTER (Special Section on Information Theory and Its Applications)
Category: Source Coding and Data Compression
Keyword: 
lossless data compressionsource codingvariable-to-fixed length codeTunstall codeaverage coding rate
 Summary | Full Text:PDF

Lossless Data Compression via Substring Enumeration for k-th Order Markov Sources with a Finite Alphabet
Ken-ichi IWATA Mitsuharu ARIMURA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2016/12/01
Vol. E99-A  No. 12 ; pp. 2130-2135
Type of Manuscript:  Special Section PAPER (Special Section on Information Theory and Its Applications)
Category: Source Coding and Data Compression
Keyword: 
lossless data compressionuniversal source codingdata compression via substring enumerationk-th order Markov sourcesmaximum redundancy
 Summary | Full Text:PDF

Almost Sure Convergence Coding Theorems of One-Shot and Multi-Shot Tunstall Codes for Stationary Memoryless Sources
Mitsuharu ARIMURA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2015/12/01
Vol. E98-A  No. 12 ; pp. 2393-2406
Type of Manuscript:  Special Section PAPER (Special Section on Information Theory and Its Applications)
Category: Source Coding
Keyword: 
lossless data compressionVF codeTunstall codealmost sure convergenceCartesian concatenationgeometric mean
 Summary | Full Text:PDF

Evaluation of Maximum Redundancy of Data Compression via Substring Enumeration for k-th Order Markov Sources
Ken-ichi IWATA Mitsuharu ARIMURA Yuki SHIMA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2014/08/01
Vol. E97-A  No. 8 ; pp. 1754-1760
Type of Manuscript:  PAPER
Category: Information Theory
Keyword: 
lossless data compressionuniversal source codingdata compression via substring enumerationk-th order Markov sourcesmaximum redundancy
 Summary | Full Text:PDF

On the Average Coding Rate of the Tunstall Code for Stationary and Memoryless Sources
Mitsuharu ARIMURA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2010/11/01
Vol. E93-A  No. 11 ; pp. 1904-1911
Type of Manuscript:  Special Section PAPER (Special Section on Information Theory and Its Applications)
Category: Source Coding
Keyword: 
lossless data compressionVF codeTunstall codedefinition of average coding ratepointwise redundancy rate
 Summary | Full Text:PDF

Unequal Error Protection in Ziv-Lempel Coding
Eiji FUJIWARA Masato KITAKAMI 
Publication:   IEICE TRANSACTIONS on Information and Systems
Publication Date: 2003/12/01
Vol. E86-D  No. 12 ; pp. 2595-2600
Type of Manuscript:  Special Section PAPER (Special Issue on Dependable Computing)
Category: Dependable Communication
Keyword: 
lossless data compressionZiv-Lempel codingLZWLZ77error control codingunequal error protection
 Summary | Full Text:PDF

Asymptotic Optimality of the Block Sorting Data Compression Algorithm
Mitsuharu ARIMURA Hirosuke YAMAMOTO 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1998/10/25
Vol. E81-A  No. 10 ; pp. 2117-2122
Type of Manuscript:  Special Section PAPER (Special Section on Information Theory and Its Applications)
Category: Source Coding
Keyword: 
lossless data compressionblock sorting algorithmstationary ergodic Markov sourceasymptotic optimality
 Summary | Full Text:PDF