Demo Data from EDBT 2026 / reviewers in the wild / expert
Douglas J. Muder
dblp:17/2173
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 1993
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 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 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory
trellis representation |
0.0 | 1 | 1988 | Minimal trellises for block codes · IEEE Trans. Inf. Theory 1988 |
Coding theory › error-correcting codes
block codes |
0.0 | 1 | 1988 | Minimal trellises for block codes · IEEE Trans. Inf. Theory 1988 |
Coding theory › error-correcting codes › block codes
MDS codes |
0.0 | 1 | 1988 | Minimal trellises for block codes · IEEE Trans. Inf. Theory 1988 |
Coding theory › error-correcting codes
perfect codes |
0.0 | 1 | 1988 | Minimal trellises for block codes · IEEE Trans. Inf. Theory 1988 |
Methods — techniques the papers use, named apart from their topics
trellis bounds analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1993 | A New Bound on the Local Density of Sphere Packings
Douglas J. Muder |
Discret. Comput. Geom. | 1 |
| 1988 | Minimal trellises for block codesabstractBasic concepts in the study of trellises of block codes are defined. It is shown that minimal proper trellises exists for all block codes. Bounds on the size of such trellises are established. These bounds are shown to be exact for maximum distance separable codes and nearly so for perfect codes.> Douglas J. Muder |
IEEE Trans. Inf. Theory | 1 |