EDBT 2026 Demo / reviewers in the wild / expert
Jutta Pokorny
dblp:73/427
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1985
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 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
1 paper |
Coding theory · 61% Information theory · 39% |
Topics — the 4 heaviest of 4, 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 | 1 | 1985 | Random coding bound and codes produced by permutations for the multiple-access channel · IEEE Trans. Inf. Theory 1985 |
Coding theory › error-correcting codes › combinatorial coding theory
permutation codes |
0.0 | 1 | 1985 | Random coding bound and codes produced by permutations for the multiple-access channel · IEEE Trans. Inf. Theory 1985 |
Coding theory › channel coding › error probability bounds
random coding bound |
0.0 | 1 | 1985 | Random coding bound and codes produced by permutations for the multiple-access channel · IEEE Trans. Inf. Theory 1985 |
Information theory
channel capacity |
0.0 | 1 | 1985 | Random coding bound and codes produced by permutations for the multiple-access channel · IEEE Trans. Inf. Theory 1985 |
Methods — techniques the papers use, named apart from their topics
random coding · 0.0permutation coding · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1985 | Random coding bound and codes produced by permutations for the multiple-access channelabstractA random coding bound for the multiple-access channel (MAC) is given, and it is shown to be obtainable universally for all MAC's with common input and output alphabets. For channels for which the random coding bound may be achieved by codes consisting of codewords of a single type for each sender, this bound is also achievable by codes produced by permutations. Jutta Pokorny, Hans-Martin Wallmeier |
IEEE Trans. Inf. Theory | 1 |