Mitsuharu Arimura
According to our database1,
Mitsuharu Arimura
authored at least 21 papers
between 2005 and 2018.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2018
A Variable-to-Fixed Length Lossless Source Code Attaining Better Performance than Tunstall Code in Several Criterions.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018
2016
Lossless Data Compression via Substring Enumeration for <i>k</i>-th Order Markov Sources with a Finite Alphabet.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016
Average Coding Rate of a Multi-Shot Tunstall Code with an Arbitrary Parsing Tree Sequence.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016
A two-step universal VV code using an asymptotically sufficient statistic extracted from a VF code.
Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016
A variable-to-fixed length lossless source code optimizing a different criterion of average coding rate from Tunstall code.
Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016
A grammar-based compression using a variation of Chomsky normal form of context free grammar.
Proceedings of the 2016 International Symposium on Information Theory and Its Applications, 2016
2015
Almost Sure Convergence Coding Theorems of One-Shot and Multi-Shot Tunstall Codes for Stationary Memoryless Sources.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015
Lossless Data Compression via Substring Enumeration for k-th Order Markov Sources with a Finite Alphabet.
Proceedings of the 2015 Data Compression Conference, 2015
2014
Evaluation of Maximum Redundancy of Data Compression via Substring Enumeration for <i>k</i>-th Order Markov Sources.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2014
Proceedings of the International Symposium on Information Theory and its Applications, 2014
2013
A Characterization of Optimal FF Coding Rate Using a New Optimistically Optimal Code.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013
Redundancy-Optimal FF Codes for a General Source and Its Relationships to the Rate-Optimal FF Codes.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2013
2012
Proceedings of the International Symposium on Information Theory and its Applications, 2012
Proceedings of the International Symposium on Information Theory and its Applications, 2012
2011
Coding theorems on the worst-case redundancy of fixed-length coding for a general source.
Proceedings of the 2011 IEEE International Symposium on Information Theory Proceedings, 2011
Proceedings of the 10th IEEE/ACIS International Conference on Computer and Information Science, 2011
2010
On the Average Coding Rate of the Tunstall Code for Stationary and Memoryless Sources.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2010
The minimum achievable redundancy rate of fixed-to-fixed length source codes for general sources.
Proceedings of the International Symposium on Information Theory and its Applications, 2010
Proceedings of the IEEE International Symposium on Information Theory, 2010
2005
IEEE Trans. Inf. Theory, 2005
An extension of asymptotically sufficient statistic method for pointwise strong universality.
Proceedings of the 2005 IEEE International Symposium on Information Theory, 2005