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 EDBT 2026 / reviewers in the wild / expert

Stephen Fratini

dblp:25/2299 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 1989
—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 2 heaviest of 2, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
error detection		 0.011989
Error detection in a class of decimal codes · IEEE Trans. Inf. Theory 1989
Coding theory › error-correcting codes › block codes › linear code
parity-check codes		 0.011989
Error detection in a class of decimal codes · IEEE Trans. Inf. Theory 1989

Methods — techniques the papers use, named apart from their topics

probability analysis · 0.0
YearPublicationVenuePosition
1989 Error detection in a class of decimal codes
abstract
Consideration is given to the problem of multiple parity checks for an n-digit number. Each check relates to specific digits, where the probability p of a particular digit being in error is fixed. The author proves that it is best, in the sense of minimizing the probability of an undetected error, to add either one or n parity checks, depending on the value of n and p.>
Stephen Fratini
 IEEE Trans. Inf. Theory1