EDBT 2026 Demo / reviewers in the wild / expert
James R. Schatz
dblp:28/6358
· DBLP profile ↗
3ranked-venue papers
1as first author
0since 2021 · last 1985
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 3 · 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
3 papers |
Coding theory · 82% Algorithms and data structures · 18% |
Topics — the 7 heaviest of 7, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes
covering radius |
0.0 | 2 | 1985 | Covering radius - Survey and recent results · IEEE Trans. Inf. Theory 1985 The second order Reed-Muller code of length 64 has covering radius 18 · IEEE Trans. Inf. Theory 1981 |
Coding theory › error-correcting codes
reed-muller codes |
0.0 | 2 | 1981 | The second order Reed-Muller code of length 64 has covering radius 18 · IEEE Trans. Inf. Theory 1981 Some applications of Good's theorem (Corresp.) · IEEE Trans. Inf. Theory 1980 |
Coding theory
covering codes |
0.0 | 1 | 1985 | Covering radius - Survey and recent results · IEEE Trans. Inf. Theory 1985 |
Coding theory › error-correcting codes
algebraic coding theory |
0.0 | 1 | 1980 | Some applications of Good's theorem (Corresp.) · IEEE Trans. Inf. Theory 1980 |
Coding theory › error-correcting codes
decoding |
0.0 | 1 | 1980 | Some applications of Good's theorem (Corresp.) · IEEE Trans. Inf. Theory 1980 |
Algorithms and data structures › signal processing algorithms
discrete fourier transform |
0.0 | 1 | 1980 | Some applications of Good's theorem (Corresp.) · IEEE Trans. Inf. Theory 1980 |
Algorithms and data structures › linear algebra › linear algebra algorithms › fast transforms
walsh-hadamard transform |
0.0 | 1 | 1980 | Some applications of Good's theorem (Corresp.) · IEEE Trans. Inf. Theory 1980 |
Methods — techniques the papers use, named apart from their topics
reed-muller codes · 0.0asymptotic bounds · 0.0good's theorem · 0.0coset leader construction · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1985 | Covering radius - Survey and recent resultsabstractAll known results on covering radius are presented, as well as some new results. There are a number of upper and lower bounds, including asymptotic results, a few exact determinations of covering radius, some extensive relations with other aspects of coding theory through the Reed-Muller codes, and new results on the least covering radius of any linear[n,k]code. There is also a recent result on the complexity of computing the covering radius. Gérard D. Cohen, Mark G. Karpovsky, Harold F. Mattson, James R. Schatz |
IEEE Trans. Inf. Theory | 4 |
| 1981 | The second order Reed-Muller code of length 64 has covering radius 18abstractThe assertion of the title is proved by first showing that the covering radius ofR(2, 6)cannot exceed18and then constructing a weight18coset leader. James R. Schatz |
IEEE Trans. Inf. Theory | 1 |
| 1980 | Some applications of Good's theorem (Corresp.)abstractThree applications of a theorem of I. J. Good are made: a simplification of the fast Hadamard transform algorithm of R.R. Green used in the decoding of first-order Reed-Muller codes, a simple proof of the well-known Parseval formula, and an application to the discrete one-dimensional Fourier transform. H. Manley, Harold F. Mattson, James R. Schatz |
IEEE Trans. Inf. Theory | 3 |