Demo Data from SIGIR 2026 / reviewers in the wild / expert
Jeffrey L. Anderson
dblp:55/5019
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1992
—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 |
0.0 | 1 | 1992 | On minimal decoding sets for the extended binary Golay code · IEEE Trans. Inf. Theory 1992 |
Coding theory › error-correcting codes › perfect codes
golay code |
0.0 | 1 | 1992 | On minimal decoding sets for the extended binary Golay code · IEEE Trans. Inf. Theory 1992 |
Coding theory › error-correcting codes › decoding › decoding algorithms › decoding of block codes
permutation decoding |
0.0 | 1 | 1992 | On minimal decoding sets for the extended binary Golay code · IEEE Trans. Inf. Theory 1992 |
Methods — techniques the papers use, named apart from their topics
combinatorial optimization · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1992 | On minimal decoding sets for the extended binary Golay codeabstractMinimal decoding sets consisting of fourteen permutations have been found for the (24,12,8) extended binary Golay code. It is shown that by properly sequencing the permutations of one such set, the average number of permutations required to decode a random received word can be minimized.> Jeffrey L. Anderson |
IEEE Trans. Inf. Theory | 1 |