Demo Data from EDBT 2026 / reviewers in the wild / expert
A. I. Hansson
dblp:61/3874
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1997
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1
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 · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes › coding bounds
asymptotic bounds |
0.0 | 1 | 1997 | Constructive codes with unequal error protection · IEEE Trans. Inf. Theory 1997 |
Coding theory › error-correcting codes
nonlinear codes |
0.0 | 1 | 1997 | Constructive codes with unequal error protection · IEEE Trans. Inf. Theory 1997 |
Coding theory › error-correcting codes
unequal error protection |
0.0 | 1 | 1997 | Constructive codes with unequal error protection · IEEE Trans. Inf. Theory 1997 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1997 | Constructive codes with unequal error protectionabstractAn asymptotic lower bound on the rates of two-level binary codes with unequal error protection is presented. The bound is based on a class of codes that are constructive in the sense that the description complexity is polynomial in the codeword length. In some cases, the bound exceeds an upper bound for linear codes, proving the existence of constructive nonlinear UEP codes that are better than any linear codes. Eva K. Englund, A. I. Hansson |
IEEE Trans. Inf. Theory | 2 |