Demo Data from EDBT 2026 / reviewers in the wild / expert
Bas Heijne
dblp:16/8860
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 2009
—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 · 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 › q-ary codes
binary codes |
0.1 | 1 | 2009 | On the minimal distance of binary self-dual cyclic codes · IEEE Trans. Inf. Theory 2009 |
Coding theory › error-correcting codes
cyclic codes |
0.1 | 1 | 2009 | On the minimal distance of binary self-dual cyclic codes · IEEE Trans. Inf. Theory 2009 |
Coding theory › error-correcting codes › block codes › linear code
self-dual codes |
0.1 | 1 | 2009 | On the minimal distance of binary self-dual cyclic codes · IEEE Trans. Inf. Theory 2009 |
Methods — techniques the papers use, named apart from their topics
explicit construction · 0.1distance bounds · 0.1
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2009 | On the minimal distance of binary self-dual cyclic codesabstractIn this paper, an explicit construction of binary self-dual cyclic codes of lengthngoing to infinity with a minimal distance at least half the square root ofnis presented. The same idea is also used to construct more general binary cyclic codes with a large minimal distance. Finally, in the special case of self-dual cyclic codes, a simplified version of a proof by Conway and Sloane is given, showing an upper bound for the distance of binary self-dual codes. Bas Heijne, Jaap Top |
IEEE Trans. Inf. Theory | 1 |