An extension of asymptotically sufficient statistic method for pointwise strong universality. - Mitsuharu Arimura; Hiroshi Nagaoka (ISIT, 2005)

Asymptotic redundancy of the MTF scheme for stationary ergodic sources. - Mitsuharu Arimura; Hirosuke Yamamoto (IEEE Trans. Inf. Theory, 2005)

On the achievable redundancy rate of fixed length source code for general sources. - Mitsuharu Arimura; Ken-ichi Iwata (ISIT, 2010)

The minimum achievable redundancy rate of fixed-to-fixed length source codes for general sources. - Mitsuharu Arimura; Ken-ichi Iwata (ISITA, 2010)

On the Average Coding Rate of the Tunstall Code for Stationary and Memoryless Sources. - Mitsuharu Arimura (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010)

An Improvement in Lossless Data Compression via Substring Enumeration. - Ken-ichi Iwata; Mitsuharu Arimura; Yuki Shima (ACIS-ICIS, 2011)

Coding theorems on the worst-case redundancy of fixed-length coding for a general source. - Hiroki Koga; Mitsuharu Arimura; Ken-ichi Iwata (ISIT, 2011)

On variable-to-fixed length coding of a general source with infinite alphabet. - Mitsuharu Arimura; Ken-ichi Iwata (ISITA, 2012)

On the maximum redundancy of CSE for I.I.D. sources. - Ken-ichi Iwata; Mitsuharu Arimura; Yuki Shima (ISITA, 2012)

Redundancy-Optimal FF Codes for a General Source and Its Relationships to the Rate-Optimal FF Codes. - Mitsuharu Arimura; Hiroki Koga; Ken-ichi Iwata (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013)

A Characterization of Optimal FF Coding Rate Using a New Optimistically Optimal Code. - Mitsuharu Arimura; Hiroki Koga; Ken-ichi Iwata (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013)

On the coding rate of a multishot Tunstall code for stationary memoryless sources. - Mitsuharu Arimura (ISITA, 2014)

Evaluation of Maximum Redundancy of Data Compression via Substring Enumeration for k-th Order Markov Sources. - Ken-ichi Iwata; Mitsuharu Arimura; Yuki Shima (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014)

Lossless Data Compression via Substring Enumeration for k-th Order Markov Sources with a Finite Alphabet. - Ken-ichi Iwata; Mitsuharu Arimura (DCC, 2015)

Almost Sure Convergence Coding Theorems of One-Shot and Multi-Shot Tunstall Codes for Stationary Memoryless Sources. - Mitsuharu Arimura (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015)

A grammar-based compression using a variation of Chomsky normal form of context free grammar. - Mitsuharu Arimura (ISITA, 2016)

A variable-to-fixed length lossless source code optimizing a different criterion of average coding rate from Tunstall code. - Mitsuharu Arimura (ISITA, 2016)

A two-step universal VV code using an asymptotically sufficient statistic extracted from a VF code. - Mitsuharu Arimura; Hiroshi Nagaoka (ISITA, 2016)

Average Coding Rate of a Multi-Shot Tunstall Code with an Arbitrary Parsing Tree Sequence. - Mitsuharu Arimura (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016)

Lossless Data Compression via Substring Enumeration for k-th Order Markov Sources with a Finite Alphabet. - Ken-ichi Iwata; Mitsuharu Arimura (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016)

A Variable-to-Fixed Length Lossless Source Code Attaining Better Performance than Tunstall Code in Several Criterions. - Mitsuharu Arimura (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018)

A Class of Data Compression Where The Codeword Is a Computer Program Generating The Data. - Mitsuharu Arimura (ISITA, 2022)