Yasuichi Horibe

According to our database, Yasuichi Horibe authored at least 13 papers between 1970 and 2008.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2008

A dropping proof of an entropy inequality.

Masahiro Yanagida, Yasuichi Horibe

Appl. Math. Lett., 2008

2007

Entropy and a certain cost-minimal coloring of graph vertices.

Yasuichi Horibe, Ryoji Mitani

Appl. Math. Lett., 2007

2003

A note on Kolmogorov complexity and entropy.

Yasuichi Horibe

Appl. Math. Lett., 2003

1985

Entropy and correlation.

Yasuichi Horibe

IEEE Trans. Syst. Man Cybern., 1985

1981

Entropy and an optimal random number transformation.

Yasuichi Horibe

IEEE Trans. Inf. Theory, 1981

1979

On the Max-Entropy Rule for a Binary Search Tree.

Yasuichi Horibe, Tibor O. H. Nemetz

Acta Informatica, 1979

1977

An Improved Bound for Weight-Balanced Tree

Yasuichi Horibe

Inf. Control., June, 1977

1976

Product-sum use of parallel channels (Corresp.).

Yasuichi Horibe

IEEE Trans. Inf. Theory, 1976

1975

A further note on the dual structure in information theory.

Yasuichi Horibe

Inf. Sci., 1975

1974

On the optimum ratio of word lengths in communication.

Yasuichi Horibe

IEEE Trans. Inf. Theory, 1974

1973

A Note on Entropy Metrics

Yasuichi Horibe

Inf. Control., May, 1973

Cost-capacity problem as a "dual" to the rate-distortion theory.

Yasuichi Horibe

Inf. Sci., 1973

1970

On zero error probability of binary decisions (Corresp.).

Yasuichi Horibe

IEEE Trans. Inf. Theory, 1970