VLDB 2026 Research / reviewers in the wild / expert
Nicholas J. Patterson
dblp:63/5971 · also Nick J. Patterson
· DBLP profile ↗
4ranked-venue papers
4as first author
0since 2021 · last 1990
0009-0007-7023-0476ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 4 · 4 first-authorDatabases, data management, data science and information retrieval · 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
2 papers |
Coding theory · 100% |
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 | 1 | 1983 | The covering radius of the (215, 16) Reed-Muller code is at least 16276 · IEEE Trans. Inf. Theory 1983 |
Coding theory › error-correcting codes
reed-muller codes |
0.0 | 1 | 1983 | The covering radius of the (215, 16) Reed-Muller code is at least 16276 · IEEE Trans. Inf. Theory 1983 |
Coding theory › error-correcting codes › decoding
algebraic decoding |
0.0 | 1 | 1975 | The algebraic decoding of Goppa codes · IEEE Trans. Inf. Theory 1975 |
Coding theory
error-correcting codes |
0.0 | 1 | 1975 | The algebraic decoding of Goppa codes · IEEE Trans. Inf. Theory 1975 |
Coding theory › error-correcting codes › algebraic geometry code
goppa codes |
0.0 | 1 | 1975 | The algebraic decoding of Goppa codes · IEEE Trans. Inf. Theory 1975 |
Coding theory › error-correcting codes › cyclic codes
BCH codes |
0.0 | 1 | 1975 | The algebraic decoding of Goppa codes · IEEE Trans. Inf. Theory 1975 |
Coding theory › error-correcting codes › decoding › decoding algorithms
berlekamp's algorithm |
0.0 | 1 | 1975 | The algebraic decoding of Goppa codes · IEEE Trans. Inf. Theory 1975 |
Methods — techniques the papers use, named apart from their topics
coset analysis · 0.0algebraic decoding algorithm · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1990 | Correction to 'The covering radius of the (215, 16) Reed-Muller code is at least 16276' (May 83 354-356)
Nicholas J. Patterson, Douglas H. Wiedemann |
IEEE Trans. Inf. Theory | 1 |
| 1988 | Finding the Vertices Nearest to a Point in a Hypercube
Nicholas J. Patterson, Kenneth J. Supowit |
Inf. Process. Lett. | 1 |
| 1983 | The covering radius of the (215, 16) Reed-Muller code is at least 16276abstractTwo interesting cosets of the first-order Reed-Muller code of block length2^{15}are described. They provide counterexamples to a conjecture on the covering radius. Nicholas J. Patterson, Douglas H. Wiedemann |
IEEE Trans. Inf. Theory | 1 |
| 1975 | The algebraic decoding of Goppa codesabstractAn interesting class of linear error-correcting codes has been found by Goppa [3], [4]. This paper presents algebraic decoding algorithms for the Goppa codes. These algorithms are only a little more complex than Berlekamp's well-known algorithm for BCH codes and, in fact, make essential use of his procedure. Hence the cost of decoding a Goppa code is similar to the cost of decoding a BCH code of comparable block length. Nicholas J. Patterson |
IEEE Trans. Inf. Theory | 1 |