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

Vesselin Vavrek

dblp:23/2425 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2003
—ORCID · none

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

Theory of computation · 3

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
3 papers
Coding theory · 94% Algorithms and data structures · 6%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › coding bounds
linear code bounds		 0.122000
The smallest length of eight-dimensional binary linear codes with prescribed minimum distance · IEEE Trans. Inf. Theory 2000
Some bounds for the minimum length of binary linear codes of dimension nine · IEEE Trans. Inf. Theory 2000
Coding theory › error-correcting codes
covering radius		 0.012003
On the least covering radius of binary linear codes with small lengths · IEEE Trans. Inf. Theory 2003
Coding theory › error-correcting codes › block codes
linear code		 0.012003
On the least covering radius of binary linear codes with small lengths · IEEE Trans. Inf. Theory 2003
Algorithms and data structures
classification		 0.012003
On the least covering radius of binary linear codes with small lengths · IEEE Trans. Inf. Theory 2003

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

nonexistence proof · 0.1code construction · 0.1code classification · 0.0
YearPublicationVenuePosition
2003 On the least covering radius of binary linear codes with small lengths
abstract
Using classification of codes with a certain covering radius it is proved that the least covering radius t[17,6]=5; t[17,8]=4; t[18,7]=5; t[19,7]=5; t[20,8]=5; and t[21,7]=6. As a corollary, four improvements on the length function l(m,R) are found. It is also shown that there exists a unique[14,6] code with covering radius 3.
Tsonka Stefanova Baicheva, Vesselin Vavrek
 IEEE Trans. Inf. Theory2
2000 Some bounds for the minimum length of binary linear codes of dimension nine
abstract
We prove the nonexistence of binary [69,9,32] codes and construct codes with parameters [76,9,34],[297,9,146], and [300,9,148]. These results show that n(9,32)=70, n(9,34)/spl les/76,n(9,146)=297, and n(9,148)=300, where n(k,d) denotes the smallest value of n for which there exists an [n,k,d] binary code. We also present some codes of minimum distance 32 and some related codes.
Iliya Bouyukliev, Sugi Guritman, Vesselin Vavrek
 IEEE Trans. Inf. Theory3
2000 The smallest length of eight-dimensional binary linear codes with prescribed minimum distance
abstract
Let n(8,d) be the smallest integer n for which a binary linear code of length n, dimension 8, and minimum distance d exists. We prove that n(8,18)=42, n(8,26)=58, n(8,28)=61, n(8,30)=65, n(8,34)=74, n(8,36)=77, n(8,38)=81, n(8,42)=89, and n(8,60)=124. After these results, all values of n(8,d) are known.
Iliya Bouyukliev, David B. Jaffe, Vesselin Vavrek
 IEEE Trans. Inf. Theory3