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

Don Li

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

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

Computer networks · 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 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory
error-correcting codes		 0.011998
Reply to comments on "Error rate performance of the projection code" · IEEE Trans. Commun. 1998
Coding theory › error-correcting codes › block codes › linear code
projection code		 0.011998
Reply to comments on "Error rate performance of the projection code" · IEEE Trans. Commun. 1998
Coding theory › error-correcting codes › coding metrics
hamming distance		 0.011998
Reply to comments on "Error rate performance of the projection code" · IEEE Trans. Commun. 1998
YearPublicationVenuePosition
1998 Reply to comments on "Error rate performance of the projection code"
abstract
The authors reply to the comments by Koppelaar and Tolhuizen (see ibid. vol.46, no.9, p.573, 1998). They state that the optimum choice of the slopes used to perform the encoding process in a projection code always results in maximizing the minimum Hamming distance so that d=2/sup r/.
Don Li, George Yang, Donald L. Schilling
 IEEE Trans. Commun.1