Demo Data from EDBT 2026 / reviewers in the wild / expert
Motoaki Ohkubo
dblp:63/83
· DBLP profile ↗
4ranked-venue papers
4as first author
0since 2021 · last 1981
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 4 · 4 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
4 papers |
Information theory · 71% Coding theory · 29% |
Topics — the 11 heaviest of 11, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Information theory › network information theory
multiple-access channel |
0.0 | 4 | 1981 | Universal coding for multiple access channels · IEEE Trans. Inf. Theory 1981 A strong outer bound to the capacity region for multiple access channels · IEEE Trans. Inf. Theory 1981 Concatenated codes for multiple access channels (Corresp.) · IEEE Trans. Inf. Theory 1980 |
Information theory
network information theory |
0.0 | 4 | 1981 | Universal coding for multiple access channels · IEEE Trans. Inf. Theory 1981 A strong outer bound to the capacity region for multiple access channels · IEEE Trans. Inf. Theory 1981 Concatenated codes for multiple access channels (Corresp.) · IEEE Trans. Inf. Theory 1980 |
Information theory › channel capacity
capacity region |
0.0 | 2 | 1981 | A strong outer bound to the capacity region for multiple access channels · IEEE Trans. Inf. Theory 1981 Concatenated codes for multiple access channels (Corresp.) · IEEE Trans. Inf. Theory 1980 |
Information theory › channel capacity
coding theorem |
0.0 | 1 | 1981 | A strong outer bound to the capacity region for multiple access channels · IEEE Trans. Inf. Theory 1981 |
Information theory › channel capacity › capacity bounds
outer bound |
0.0 | 1 | 1981 | A strong outer bound to the capacity region for multiple access channels · IEEE Trans. Inf. Theory 1981 |
Coding theory › source coding
universal coding |
0.0 | 1 | 1981 | Universal coding for multiple access channels · IEEE Trans. Inf. Theory 1981 |
Coding theory › error-correcting codes
concatenated codes |
0.0 | 1 | 1980 | Concatenated codes for multiple access channels (Corresp.) · IEEE Trans. Inf. Theory 1980 |
Coding theory › multiuser coding
multiple-access channel coding |
0.0 | 1 | 1980 | Concatenated codes for multiple access channels (Corresp.) · IEEE Trans. Inf. Theory 1980 |
Coding theory › error-correcting codes
convolutional codes |
0.0 | 1 | 1977 | Convolutional tree codes for multiple access channels (Corresp.) · IEEE Trans. Inf. Theory 1977 |
Coding theory › interactive communication
tree codes |
0.0 | 1 | 1977 | Convolutional tree codes for multiple access channels (Corresp.) · IEEE Trans. Inf. Theory 1977 |
Coding theory › error-correcting codes › convolutional codes › convolutional code decoding
viterbi decoding |
0.0 | 1 | 1977 | Convolutional tree codes for multiple access channels (Corresp.) · IEEE Trans. Inf. Theory 1977 |
Methods — techniques the papers use, named apart from their topics
hypothetical mutual information · 0.0concatenated coding theorem · 0.0arimoto converse · 0.0viterbi algorithm · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1981 | A strong outer bound to the capacity region for multiple access channelsabstractArimoto's converse to the coding theorem for discrete memoryless channel is extended to multiple access channels. The strong outer bound to the capacity region for multiple access channels that results is described analytically and graphically. Motoaki Ohkubo |
IEEE Trans. Inf. Theory | 1 |
| 1981 | Universal coding for multiple access channelsabstractThe problems of universal coding and decoding for multiple-access channels are examined. The hypothetical mutual information functions are used to prove that rate vectorsR=(R_{1},R_{2})in a subregion\hat{\cal C}of the capacity region\cal Care universally achievable in the sense that there exist codes of rateRthat are asymptotically optimum for all multiple-access channels with finite fixed input alphabetsX_{1},X_{2}, and output alphabetY. Motoaki Ohkubo |
IEEE Trans. Inf. Theory | 1 |
| 1980 | Concatenated codes for multiple access channels (Corresp.)abstractA coding theorem for concatenated codes for the memoryless multiple access channel is established, and it is shown that in the capacity region the probability of error is bound above by a function of the overall lengthN_{o}=nNand the overall rate vectorR_{o}=(r_{l}R_{1},r_{2}R_{2}). Motoaki Ohkubo |
IEEE Trans. Inf. Theory | 1 |
| 1977 | Convolutional tree codes for multiple access channels (Corresp.)abstractThe decoding algorithm of Viterbi is extended to the case of a memoryless multiple access channel. It is Shown that in the capacity region, the probability of decoding error is bounded from above by a function of the constraint length of the code. Motoaki Ohkubo |
IEEE Trans. Inf. Theory | 1 |