Demo Data from EDBT 2026 / reviewers in the wild / expert
D. E. Maracle
dblp:134/6351
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1974
—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 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes
code construction |
0.0 | 1 | 1974 | Generating cyclically permutable codes (Corresp.) · IEEE Trans. Inf. Theory 1974 |
Coding theory
constrained coding |
0.0 | 1 | 1974 | Generating cyclically permutable codes (Corresp.) · IEEE Trans. Inf. Theory 1974 |
Coding theory › constrained coding › synchronization codes
cyclically permutable codes |
0.0 | 1 | 1974 | Generating cyclically permutable codes (Corresp.) · IEEE Trans. Inf. Theory 1974 |
Coding theory › error-correcting codes › burst error correction
interleaving |
0.0 | 1 | 1974 | Generating cyclically permutable codes (Corresp.) · IEEE Trans. Inf. Theory 1974 |
Methods — techniques the papers use, named apart from their topics
interleaving · 0.0cyclic shift · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1974 | Generating cyclically permutable codes (Corresp.)abstractLarge sets of cyclically permutable (or cyclically inequivalent) codewords can be created by interleaving the cyclic shifts of several shorter words and selecting a cyclically inequivalent subset from the resulting set, This correspondence presents an efficient algorithm for generating the cyclically inequivalent subset directly. D. E. Maracle, Charles T. Wolverton |
IEEE Trans. Inf. Theory | 1 |