| |
| 2008 | ||
|---|---|---|
| 9 | EE | Masahiro Yanagida, Yasuichi Horibe: A dropping proof of an entropy inequality. Appl. Math. Lett. 21(8): 840-842 (2008) |
| 2007 | ||
| 8 | EE | Yasuichi Horibe, Ryoji Mitani: Entropy and a certain cost-minimal coloring of graph vertices. Appl. Math. Lett. 20(12): 1194-1197 (2007) |
| 2003 | ||
| 7 | EE | Yasuichi Horibe: A note on Kolmogorov complexity and entropy. Appl. Math. Lett. 16(7): 1129-1130 (2003) |
| 1981 | ||
| 6 | Yasuichi Horibe: Entropy and an optimal random number transformation. IEEE Transactions on Information Theory 27(4): 527- (1981) | |
| 1979 | ||
| 5 | Yasuichi Horibe, Tibor O. H. Nemetz: On the Max-Entropy Rule for a Binary Search Tree. Acta Inf. 12: 63-72 (1979) | |
| 1977 | ||
| 4 | Yasuichi Horibe: An Improved Bound for Weight-Balanced Tree Information and Control 34(2): 148-151 (1977) | |
| 1975 | ||
| 3 | EE | Yasuichi Horibe: A further note on the dual structure in information theory. Inf. Sci. 9(1): 81-89 (1975) |
| 1973 | ||
| 2 | EE | Yasuichi Horibe: Cost-capacity problem as a "dual" to the rate-distortion theory. Inf. Sci. 6: 359-369 (1973) |
| 1 | Yasuichi Horibe: A Note on Entropy Metrics Information and Control 22(4): 403-404 (1973) | |
| 1 | Ryoji Mitani | [8] |
| 2 | Tibor O. H. Nemetz | [5] |
| 3 | Masahiro Yanagida | [9] |