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

Zlatko Varbanov

dblp:37/2198 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2005
—ORCID · unresolved

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 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › coding bounds
linear code bounds		 0.112005
Some results for linear binary codes with minimum distance 5 and 6 · IEEE Trans. Inf. Theory 2005
Coding theory
nonexistence proofs		 0.112005
Some results for linear binary codes with minimum distance 5 and 6 · IEEE Trans. Inf. Theory 2005

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

nonexistence proof · 0.1code characterization · 0.1
YearPublicationVenuePosition
2005 Some results for linear binary codes with minimum distance 5 and 6
abstract
We prove that a linear binary code with parameters [34,24,5] does not exist. Also, we characterize some codes with minimum distance 5 and 6.
Iliya Bouyukliev, Zlatko Varbanov
 IEEE Trans. Inf. Theory2