Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from VLDB 2026 / reviewers in the wild / expert

Philip Stokes

dblp:83/4228 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1993
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 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 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
covering radius		 0.011993
Covering radius, codimension, dual-distance width · IEEE Trans. Inf. Theory 1993
Coding theory › error-correcting codes › covering radius
covering radius bound		 0.011993
Covering radius, codimension, dual-distance width · IEEE Trans. Inf. Theory 1993
YearPublicationVenuePosition
1993 Covering radius, codimension, dual-distance width
abstract
Upper bounds on the covering radius of codes with a given cardinality and a given dual-distance width are derived. Using an entirely new method, some results published by C. Delorme and P. Sole (1991) for linear codes are generalized, and results are derived for unrestricted codes that have no previous analogue. For some classes of codes, when the parameters lie within certain intervals, results improve asymptotically on the upper bounds published by A.A. Tietavainen (1990) relating the covering radius with the dual distance.>
Patrick Solé, Philip Stokes
 IEEE Trans. Inf. Theory2