Demo Data from EDBT 2026 / reviewers in the wild / expert
Daniel B. Dalan
dblp:32/4951
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 2003
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 1 · 1 first-authorTheory 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 · 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 › block codes › linear code › self-dual codes
extremal binary self-dual codes |
0.0 | 1 | 2003 | New extremal binary [44, 22, 8] codes · IEEE Trans. Inf. Theory 2003 |
Coding theory › error-correcting codes › block codes › linear code
self-dual codes |
0.0 | 1 | 2003 | New extremal binary [44, 22, 8] codes · IEEE Trans. Inf. Theory 2003 |
Coding theory › error-correcting codes
weight distribution |
0.0 | 1 | 2003 | New extremal binary [44, 22, 8] codes · IEEE Trans. Inf. Theory 2003 |
Methods — techniques the papers use, named apart from their topics
neighbors construction · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2003 | New Extremal Type I Codes of Lengths 40, 42, and 44
Daniel B. Dalan |
Des. Codes Cryptogr. | 1 |
| 2003 | New extremal binary [44, 22, 8] codesabstractOne of the problems in coding theory is constructing self-dual codes whose weight enumerators are not yet known to exist. We use the concept of neighbors and construct extremal binary self-dual [44,22,8] codes whose weight enumerators are not yet known to exist. Daniel B. Dalan |
IEEE Trans. Inf. Theory | 1 |