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

Fabio Pasticci

dblp:57/6843 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2007
—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 › block codes
linear code		 0.112007
Quasi-Perfect Linear Codes With Minimum Distance 4 · IEEE Trans. Inf. Theory 2007
Coding theory › covering codes
quasi-perfect codes		 0.112007
Quasi-Perfect Linear Codes With Minimum Distance 4 · IEEE Trans. Inf. Theory 2007
YearPublicationVenuePosition
2007 Quasi-Perfect Linear Codes With Minimum Distance 4
abstract
Some new infinite families of short quasi-perfect linear codes are described. Such codes provide improvements on the currently known upper bounds on the minimal length of a quasi-perfect [n,n-m,4]q-code when either 1) q=16, m ges 5, m odd, or 2) q=2i, 7 les i les 15, m ges 4, or 3) q=22lscr, lscr ges 8, m ges 5, m odd. As quasi-perfect [n,n-m,4]q-codes and complete n-caps in projective spaces PG(m-1,q) are equivalent objects, new upper bounds on the size of the smallest complete cap in PG(m-1,q) are obtained
Massimo Giulietti, Fabio Pasticci
 IEEE Trans. Inf. Theory2