Demo Data from EDBT 2026 / reviewers in the wild / expert
G. Hedby
dblp:95/4823
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1994
—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 · 70% Information theory · 23% Algorithmic game theory and mechanism design · 7% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › channel coding › adversarial channel
antijamming codes |
0.0 | 1 | 1994 | Error bounds for the Euclidean channel subject to intentional jamming · IEEE Trans. Inf. Theory 1994 |
Coding theory
channel coding |
0.0 | 1 | 1994 | Error bounds for the Euclidean channel subject to intentional jamming · IEEE Trans. Inf. Theory 1994 |
Coding theory › channel coding
error probability bounds |
0.0 | 1 | 1994 | Error bounds for the Euclidean channel subject to intentional jamming · IEEE Trans. Inf. Theory 1994 |
Information theory › channel capacity › arbitrarily varying channel
jamming |
0.0 | 1 | 1994 | Error bounds for the Euclidean channel subject to intentional jamming · IEEE Trans. Inf. Theory 1994 |
Algorithmic game theory and mechanism design
zero-sum game |
0.0 | 1 | 1994 | Error bounds for the Euclidean channel subject to intentional jamming · IEEE Trans. Inf. Theory 1994 |
Methods — techniques the papers use, named apart from their topics
game theory · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1994 | Error bounds for the Euclidean channel subject to intentional jammingabstractWe address the problem of communicating over channels subject to intentional interference. The problem is described in terms of a two-person zero-sum game with the probability of error as the pay-off function. We give upper and lower bounds on the error probability for antijamming codes when used over the Euclidean channel.> G. Hedby |
IEEE Trans. Inf. Theory | 1 |