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

Krassimir N. Manev

dblp:14/2218 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 1988
0000-0002-3275-374XORCID · reported

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
binary linear codes		 0.011988
On the covering radius of binary [14, 6] codes containing the all-one vector · IEEE Trans. Inf. Theory 1988
Coding theory › error-correcting codes
covering radius		 0.011988
On the covering radius of binary [14, 6] codes containing the all-one vector · IEEE Trans. Inf. Theory 1988

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

combinatorial analysis · 0.0
YearPublicationVenuePosition
1988 On the covering radius of binary [14, 6] codes containing the all-one vector
abstract
It is shown that the covering radius of any binary linear (14, 6) code containing the all-one vector is at least 4. Since the minimum covering radius of a binary linear (14, 6) code is 3, this shows that in general the minimum of the covering radius is not achieved by codes containing the all-one vector.>
Stefan M. Dodunekov, Krassimir N. Manev, Vladimir D. Tonchev
 IEEE Trans. Inf. Theory2