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

Elena Metodieva

dblp:30/2746 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1999
0000-0001-5360-4762ORCID · corroborated

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

Theory of computation · 2

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
2 papers
Coding theory · 100%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
coding bounds		 0.021999
New ternary linear codes · IEEE Trans. Inf. Theory 1999
The nonexistence of some five-dimensional quaternary linear codes · IEEE Trans. Inf. Theory 1995
Coding theory › error-correcting codes › block codes
linear code		 0.021999
New ternary linear codes · IEEE Trans. Inf. Theory 1999
The nonexistence of some five-dimensional quaternary linear codes · IEEE Trans. Inf. Theory 1995
Coding theory › error-correcting codes › coding bounds
minimum distance bounds		 0.021999
New ternary linear codes · IEEE Trans. Inf. Theory 1999
The nonexistence of some five-dimensional quaternary linear codes · IEEE Trans. Inf. Theory 1995
Coding theory › error-correcting codes › block codes › linear code › nonbinary linear codes
ternary linear codes		 0.011999
New ternary linear codes · IEEE Trans. Inf. Theory 1999
Coding theory › error-correcting codes › block codes › linear code › nonbinary linear codes
quaternary linear code		 0.011995
The nonexistence of some five-dimensional quaternary linear codes · IEEE Trans. Inf. Theory 1995
Coding theory › error-correcting codes
code construction		 0.021999
New ternary linear codes · IEEE Trans. Inf. Theory 1999
The nonexistence of some five-dimensional quaternary linear codes · IEEE Trans. Inf. Theory 1995

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

code construction · 0.0nonexistence proof · 0.0
YearPublicationVenuePosition
1999 New ternary linear codes
abstract
Let [n,k,d;q]-codes be linear codes of length n, dimension k, and minimum Hamming distance d over GF(q). In this correspondence, 18 codes are constructed which improve the known lower bounds on minimum distance.
Rumen N. Daskalov, T. Aaron Gulliver, Elena Metodieva
 IEEE Trans. Inf. Theory3
1995 The nonexistence of some five-dimensional quaternary linear codes
abstract
Let n/sub 4/(k, d) be the smallest integer n, such that a quaternary linear [n, k, d; 4]-code exists. It is proved that n/sub 4/(5, 20)=30, n/sub 4/(5, 42)/spl ges/59, n/sub 4/(5, 45)/spl ges/63, n/sub 4/(5, 64)/spl ges/88, n/sub 4/(5, 80)=109, n/sub 4/(5, 140)/spl ges/189, n/sub 4/(5, 143)/spl ges/193, n/sub 4/(5, 168)/spl ges/226, n/sub 4/(5, 180)/spl ges/242, n/sub 4/(5, 183)/spl ges/246, n/sub 4/(5, 187)=251.>
Rumen N. Daskalov, Elena Metodieva
 IEEE Trans. Inf. Theory2