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

Vassil Y. Yorgov

dblp:56/3809 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
0since 2021 · last 1999
—ORCID · none

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

Theory of computation · 4 · 2 first-authorSecurity and privacy · 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
4 papers
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes › block codes › linear code
self-dual codes		 0.041999
On the minimal weight of some singly-even codes · IEEE Trans. Inf. Theory 1999
The existence of certain extremal [54, 27, 10] self-dual codes · IEEE Trans. Inf. Theory 1996
A method for constructing inequivalent self-dual codes with applications to length 56 · IEEE Trans. Inf. Theory 1987
Coding theory › error-correcting codes › coding bounds
minimum distance bounds		 0.011999
On the minimal weight of some singly-even codes · IEEE Trans. Inf. Theory 1999
Coding theory › error-correcting codes › optimal codes
extremal codes		 0.011996
The existence of certain extremal [54, 27, 10] self-dual codes · IEEE Trans. Inf. Theory 1996
Coding theory › error-correcting codes › block codes › linear code › self-dual codes
doubly even codes		 0.021987
A method for constructing inequivalent self-dual codes with applications to length 56 · IEEE Trans. Inf. Theory 1987
A [72, 36, 16] doubly even code does not have an automorphism of order 11 · IEEE Trans. Inf. Theory 1987
Coding theory › error-correcting codes › algebraic coding theory
code automorphisms		 0.011987
A [72, 36, 16] doubly even code does not have an automorphism of order 11 · IEEE Trans. Inf. Theory 1987
Coding theory
code decomposition		 0.011987
A [72, 36, 16] doubly even code does not have an automorphism of order 11 · IEEE Trans. Inf. Theory 1987
Coding theory › error-correcting codes › code classification
code equivalence		 0.011987
A method for constructing inequivalent self-dual codes with applications to length 56 · IEEE Trans. Inf. Theory 1987

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

shadow theory · 0.0automorphism of order 7 · 0.0direct sum decomposition · 0.0automorphism-based construction · 0.0
YearPublicationVenuePosition
1999 On the minimal weight of some singly-even codes
abstract
It is shown that the minimal distance d of a singly-even self-dual [24t+8, 12t+4] code is at most 4t+2 if its shadow contains a weight 4 vector, t is even, and (/sub t//sup 5t/) is odd. It is proved particularly that there does not exist a [56, 28, 12] singly even self-dual code with 4862 words of weight 12. This answers a question raised by Conway and Sloane (see ibid., vol.36, p.1319-33, 1990).
Vassil Y. Yorgov
 IEEE Trans. Inf. Theory1
1996 Singly-Even Self-Dual Codes of Length 40
Stefka Bouyuklieva, Vassil Y. Yorgov
 Des. Codes Cryptogr.2
1996 The existence of certain extremal [54, 27, 10] self-dual codes
abstract
Some new extremal binary [54,27,10] self-dual codes are constructed using automorphisms of order 7.
Vladimir D. Tonchev, Vassil Y. Yorgov
 IEEE Trans. Inf. Theory2
1987 A [72, 36, 16] doubly even code does not have an automorphism of order 11
abstract
We prove that there does not exist a[72,36,16]doubly even code with an automorphism of order11. If such a code exists, it can be decomposed as a direct sum of two codes; one can be viewed as a self-dual[12,6,4]binary code and the other a self-dual[6,3,4]code overF_{1024}. This is shown to be impossible.
W. Cary Huffman, Vassil Y. Yorgov
 IEEE Trans. Inf. Theory2
1987 A method for constructing inequivalent self-dual codes with applications to length 56
abstract
Necessary and sufficient conditions are presented for two doubly even codes with an automorphism of odd prime order to be equivalent under certain assumptions for the codes. As an application we obtain all extremal doubly even codes of length56with an automorphism of order13. Sixteen such codes are inequivalent.
Vassil Y. Yorgov
 IEEE Trans. Inf. Theory1