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

Radoslav Kirov

dblp:66/2698 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
0since 2021 · last 2011
—ORCID · none

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
algebraic geometry code
0.112011
Improved Two-Point Codes on Hermitian Curves · IEEE Trans. Inf. Theory 2011
Coding theory
error-correcting codes
0.112011
Improved Two-Point Codes on Hermitian Curves · IEEE Trans. Inf. Theory 2011
Coding theory › error-correcting codes › algebraic geometry code
two-point codes
0.112011
Improved Two-Point Codes on Hermitian Curves · IEEE Trans. Inf. Theory 2011

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

algebraic geometry · 0.1
YearPublicationVenuePosition
2011 Improved Two-Point Codes on Hermitian Curves
abstract
One-point codes on the Hermitian curve produce long codes with excellent parameters. Feng and Rao introduced a modified construction that improves the parameters while still using one-point divisors. A separate improvement of the parameters was introduced by Matthews considering the classical construction but with two-point divisors. Those two approaches are combined to describe an elementary construction of two-point improved codes. Upon analysis of their minimum distance and redundancy, it is observed that they improve on the previous constructions for a large range of designed distances.
Iwan M. Duursma, Radoslav Kirov
IEEE Trans. Inf. Theory2