Demo Data from EDBT 2026 / reviewers in the wild / expert
John R. Wolcott
dblp:272/4946
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1975
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 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
code construction |
0.0 | 1 | 1975 | Systematic Construction of Cyclically Permutable Code Words · IEEE Trans. Commun. 1975 |
Coding theory › constrained coding › synchronization codes
cyclically permutable codes |
0.0 | 1 | 1975 | Systematic Construction of Cyclically Permutable Code Words · IEEE Trans. Commun. 1975 |
Coding theory › error-correcting codes
weight distribution |
0.0 | 1 | 1975 | Systematic Construction of Cyclically Permutable Code Words · IEEE Trans. Commun. 1975 |
Methods — techniques the papers use, named apart from their topics
numerical procedures · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1975 | Systematic Construction of Cyclically Permutable Code WordsabstractA numerical procedure for determining the cyclically permutable code of any length over an arbitrary alphabet is outlined. This method is easily programmed on a digital computer. A formula for the Hamming weight distribution of the code is also given. The results for the 12 bit binary cyclically permutable code are presented along with the weight distribution of the binary codes through length 14. G. Robert Redinbo, John R. Wolcott |
IEEE Trans. Commun. | 2 |