| Asymptotic optimality of the block sorting data compression algorithm M Arimura, H Yamamoto IEICE transactions on fundamentals of electronics, communications and …, 1998 | 25 | 1998 |
| Lossless data compression via substring enumeration for k-th order Markov sources with a finite alphabet KI Iwata, M Arimura IEICE Transactions on Fundamentals of Electronics, Communications and …, 2016 | 9 | 2016 |
| On the average coding rate of the Tunstall code for stationary and memoryless sources M Arimura IEICE transactions on fundamentals of electronics, communications and …, 2010 | 9 | 2010 |
| An improvement in lossless data compression via substring enumeration K Iwata, M Arimura, Y Shima 2011 10th IEEE/ACIS International Conference on Computer and Information …, 2011 | 8 | 2011 |
| On the maximum redundancy of CSE for iid sources K Iwata, M Arimura, Y Shima 2012 International Symposium on Information Theory and its Applications, 489-492, 2012 | 6 | 2012 |
| Almost sure convergence coding theorem for block sorting data compression algorithm M Arimura, H Yamamoto Proceedings of International Symposium on Information Theory and Its …, 1998 | 6 | 1998 |
| A bitplane tree weighting method for lossless compression of gray scale images M Arimura, H Yamamoto, S Arimoto IEICE transactions on fundamentals of electronics, communications and …, 1997 | 6 | 1997 |
| The minimum achievable redundancy rate of fixed-to-fixed length source codes for general sources M Arimura, K Iwata 2010 International Symposium On Information Theory & Its Applications, 595-600, 2010 | 5 | 2010 |
| Evaluation of maximum redundancy of data compression via substring enumeration for k-th order Markov sources K Iwata, M Arimura, Y Shima IEICE Transactions on Fundamentals of Electronics, Communications and …, 2014 | 4 | 2014 |
| General conditions for existence of weakly universal FV source codes M Arimura, H Nagaoka IEEE International Symposium on Information Theory, 2003. Proceedings., 110, 2003 | 4 | 2003 |
| A grammar-based compression using a variation of chomsky normal form of context free grammar M Arimura 2016 International Symposium on Information Theory and Its Applications …, 2016 | 3 | 2016 |
| Almost sure convergence coding theorems of one-shot and multi-shot Tunstall codes for stationary memoryless sources M Arimura IEICE Transactions on Fundamentals of Electronics, Communications and …, 2015 | 3 | 2015 |
| On the achievable redundancy rate of fixed length source code for general sources M Arimura, K Iwata 2010 IEEE International Symposium on Information Theory, 126-130, 2010 | 3 | 2010 |
| Asymptotically Sufficient Statistic Method for Evaluation of Point-wise Redundancy of FV Source Codes M Arimura Proc. 2004 International Symposium on Information Theory and Its …, 2004 | 3* | 2004 |
| On the coding rate of a multishot Tunstall code for stationary memoryless sources M Arimura 2014 International Symposium on Information Theory and its Applications, 284-288, 2014 | 2 | 2014 |
| Maximum redundancy of lossless data compression via substring enumeration with a finite alphabet K Iwata, M Arimura IEICE Technical Report; IEICE Tech. Rep. 113 (483), 7-12, 2014 | 2 | 2014 |
| Redundancy-optimal FF codes for a general source and its relationships to the rate-optimal FF codes M ARIMURA, H KOGA, K IWATA IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and …, 2013 | 2 | 2013 |
| A characterization of optimal FF coding rate using a new optimistically optimal code M ARIMURA, H KOGA, K IWATA IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and …, 2013 | 2 | 2013 |
| Maximum redundancy of lossless data compression via substring enumeration for Markov sources K Iwata, M Arimura, Y Shima IEICE Technical Report; IEICE Tech. Rep. 112 (460), 95-100, 2013 | 2 | 2013 |
| Average coding rate of a multi-shot Tunstall code with an arbitrary parsing tree sequence M Arimura IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and …, 2016 | 1 | 2016 |
Hirosuke YamamotoThe University of Tokyo (Professor Emeritus)Bestätigte E-Mail-Adresse bei ieee.org
