Demo Data from EDBT 2026 / reviewers in the wild / expert
Russell D. Stinaff
dblp:134/8142
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 1973
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2
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
2 papers |
Coding theory · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes › cyclic codes
BCH codes |
0.0 | 1 | 1973 | Shortened BCH codes (Corresp.) · IEEE Trans. Inf. Theory 1973 |
Coding theory › error-correcting codes › block codes › linear code
binary linear codes |
0.0 | 1 | 1973 | Minimum-distance bounds for binary linear codes · IEEE Trans. Inf. Theory 1973 |
Coding theory › error-correcting codes
code construction |
0.0 | 1 | 1973 | Minimum-distance bounds for binary linear codes · IEEE Trans. Inf. Theory 1973 |
Coding theory › error-correcting codes › block codes
linear code |
0.0 | 1 | 1973 | Shortened BCH codes (Corresp.) · IEEE Trans. Inf. Theory 1973 |
Coding theory › error-correcting codes › coding bounds
minimum distance bounds |
0.0 | 1 | 1973 | Minimum-distance bounds for binary linear codes · IEEE Trans. Inf. Theory 1973 |
Methods — techniques the papers use, named apart from their topics
weight spectrum · 0.0shortening · 0.0known codes · 0.0code construction technique · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1973 | Minimum-distance bounds for binary linear codesabstractThis paper presents a table of upper and lower bounds ond_{max} (n,k), the maximum minimum distance over all binary, linear(n,k)error-correcting codes. The table is obtained by combining the best of the existing bounds ond_{max} (n,k)with the minimum distances of known codes and a variety of code-construction techniques. Hermann J. Helgert, Russell D. Stinaff |
IEEE Trans. Inf. Theory | 2 |
| 1973 | Shortened BCH codes (Corresp.)abstractBy shortening certain binary primitive BCH codes, we derive a number of linear error-correcting codes with minimum distances superior to any known previously. We also give the weight spectra of three nonprimitive BCH codes whose minimum distances likewise constitute a significant improvement over those of the best codes previously known. Hermann J. Helgert, Russell D. Stinaff |
IEEE Trans. Inf. Theory | 2 |