On zero error probability of binary decisions (Corresp.). - Yasuichi Horibe (IEEE Trans. Inf. Theory, 1970)

Cost-capacity problem as a "dual" to the rate-distortion theory. - Yasuichi Horibe (Inf. Sci., 1973)

A Note on Entropy Metrics - Yasuichi Horibe (Inf. Control., 1973)

On the optimum ratio of word lengths in communication. - Yasuichi Horibe (IEEE Trans. Inf. Theory, 1974)

A further note on the dual structure in information theory. - Yasuichi Horibe (Inf. Sci., 1975)

Product-sum use of parallel channels (Corresp.). - Yasuichi Horibe (IEEE Trans. Inf. Theory, 1976)

An Improved Bound for Weight-Balanced Tree - Yasuichi Horibe (Inf. Control., 1977)

On the Max-Entropy Rule for a Binary Search Tree. - Yasuichi Horibe; Tibor O. H. Nemetz (Acta Informatica, 1979)

Entropy and an optimal random number transformation. - Yasuichi Horibe (IEEE Trans. Inf. Theory, 1981)

Entropy and correlation. - Yasuichi Horibe (IEEE Trans. Syst. Man Cybern., 1985)

A note on Kolmogorov complexity and entropy. - Yasuichi Horibe (Appl. Math. Lett., 2003)

Entropy and a certain cost-minimal coloring of graph vertices. - Yasuichi Horibe; Ryoji Mitani (Appl. Math. Lett., 2007)

A dropping proof of an entropy inequality. - Masahiro Yanagida; Yasuichi Horibe (Appl. Math. Lett., 2008)