Demo Data from VLDB 2026 / reviewers in the wild / expert
Yasuichi Horibe
dblp:76/6417
· DBLP profile ↗
10ranked-venue papers
10as first author
0since 2021 · last 1985
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 7 · 7 first-authorDatabases, data management, data science and information retrieval · 2 · 2 first-authorHuman-computer interaction and ubiquitous computing · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
6 papers |
Information theory · 75% Coding theory · 14% Algorithms and data structures · 11% |
Topics — the 8 heaviest of 10, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information theory › information measures
entropy |
0.0 | 1 | 1981 | Entropy and an optimal random number transformation · IEEE Trans. Inf. Theory 1981 |
Information theory
channel capacity |
0.0 | 1 | 1976 | Product-sum use of parallel channels (Corresp.) · IEEE Trans. Inf. Theory 1976 |
Information theory › communication channels › channel models
parallel channel |
0.0 | 1 | 1976 | Product-sum use of parallel channels (Corresp.) · IEEE Trans. Inf. Theory 1976 |
Coding theory
joint source-channel coding |
0.0 | 1 | 1974 | On the optimum ratio of word lengths in communication · IEEE Trans. Inf. Theory 1974 |
Coding theory › source coding
rate-distortion theory |
0.0 | 1 | 1974 | On the optimum ratio of word lengths in communication · IEEE Trans. Inf. Theory 1974 |
Information theory › information measures › entropy
entropy measures |
0.0 | 1 | 1973 | A Note on Entropy Metrics · Inf. Control. 1973 |
Information theory › communication channels › channel comparison
channel degradation |
0.0 | 1 | 1970 | On zero error probability of binary decisions (Corresp.) · IEEE Trans. Inf. Theory 1970 |
Information theory
communication channels |
0.0 | 1 | 1970 | On zero error probability of binary decisions (Corresp.) · IEEE Trans. Inf. Theory 1970 |
Methods — techniques the papers use, named apart from their topics
knuth-yao procedure · 0.0entropy analysis · 0.0capacity analysis · 0.0block coding analysis · 0.0rényi result simplification · 0.0randomized decision scheme · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1985 | Entropy and correlationabstractA simple an intuitively interpretable correlation coefficient between two discrete random variables is defined. Its metric property is then proved. Yasuichi Horibe |
IEEE Trans. Syst. Man Cybern. | 1 |
| 1981 | Entropy and an optimal random number transformationabstractA simple proof is given of the optimality of the procedure of D. E. Knuth and A. C. Yao for transforming a random number with distribution(1/2, 1/2)into one with distribution(p_{1}, \cdots,p_{r}). A direct representation of the cost (average number of input symbols needed to output one symbol) of the optimal transformation is given in terms of entropy, a procedure that leads to a refined entropic upper bound to the cost. Yasuichi Horibe |
IEEE Trans. Inf. Theory | 1 |
| 1979 | On the Max-Entropy Rule for a Binary Search Tree
Yasuichi Horibe, Tibor O. H. Nemetz |
Acta Informatica | 1 |
| 1977 | An Improved Bound for Weight-Balanced Tree
Yasuichi Horibe |
Inf. Control. | 1 |
| 1976 | Product-sum use of parallel channels (Corresp.)abstractSome potential merits of a product-sum use of parallel channels are discussed via simple examples with emphasis on the functional dependence of the capacity on the capacities of the component channels. Yasuichi Horibe |
IEEE Trans. Inf. Theory | 1 |
| 1975 | A further note on the dual structure in information theory
Yasuichi Horibe |
Inf. Sci. | 1 |
| 1974 | On the optimum ratio of word lengths in communicationabstractAn elementary account concerning the optimum ratio between the source word (block) length and the block length of the corresponding channel codeword is given. By "optimum" it is meant that by choosing a suitable ratio of word lengths we can attain the theoretically optimum balance between the average distortion of the source information and the average "cost" (in a general sense) of using the channel. Yasuichi Horibe |
IEEE Trans. Inf. Theory | 1 |
| 1973 | A Note on Entropy Metrics
Yasuichi Horibe |
Inf. Control. | 1 |
| 1973 | Cost-capacity problem as a "dual" to the rate-distortion theory
Yasuichi Horibe |
Inf. Sci. | 1 |
| 1970 | On zero error probability of binary decisions (Corresp.)abstractIn view of a certain randomized decision scheme, we simplify Rényi's result that concerns the conditions that a changing situation for binary decision must satisfy in order that the probability of decision errors tend to zero. We give its possible interpretation for a communication channel that has a tendency to become useless with time. Yasuichi Horibe |
IEEE Trans. Inf. Theory | 1 |