Mitsuharu ARIMURA


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(577.3KB)

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(350.8KB)

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(88.6KB)

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(393KB)

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(356.5KB)

A Characterization of Optimal FF Coding Rate Using a New Optimistically Optimal Code
Mitsuharu ARIMURA Hiroki KOGA Ken-ichi IWATA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2013/12/01
Vol. E96-A  No. 12  pp. 2443-2446
Type of Manuscript:  Special Section LETTER (Special Section on Information Theory and Its Applications)
Category: Source Coding
Keyword: 
information spectrumgeneral sourceFF codeoptimistic achievable coding rate
 Summary | Full Text:PDF(92.1KB)

Redundancy-Optimal FF Codes for a General Source and Its Relationships to the Rate-Optimal FF Codes
Mitsuharu ARIMURA Hiroki KOGA Ken-ichi IWATA 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 2013/12/01
Vol. E96-A  No. 12  pp. 2332-2342
Type of Manuscript:  Special Section PAPER (Special Section on Information Theory and Its Applications)
Category: Source Coding
Keyword: 
fixed-to-fixed length source codinginformation-spectrum methodsgeneral sourcescoding rateredundancy
 Summary | Full Text:PDF(670.1KB)

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(203.4KB)

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(427.8KB)

A Bitplane Tree Weighting Method for Lossless Compression of Gray Scale Images
Mitsuharu ARIMURA Hirosuke YAMAMOTO Suguru ARIMOTO 
Publication:   IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences
Publication Date: 1997/11/25
Vol. E80-A  No. 11  pp. 2268-2271
Type of Manuscript:  Special Section LETTER (Special Section on Information Theory and Its Applications)
Category: Source Coding/Channel Capacity
Keyword: 
image compressionlossless compressiongray scale imageCTW method
 Summary | Full Text:PDF(326KB)