EDBT 2026 Demo / reviewers in the wild / expert

G. L. Katsman

dblp:71/786 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
0since 2021 · last 1984
—ORCID · none

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

Theory of computation · 2 · 1 first-author

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
algebraic geometry code		 0.011984
Modular curves and codes with a polynomial construction · IEEE Trans. Inf. Theory 1984
Coding theory › error-correcting codes › algebraic geometry code
modular curve code		 0.011984
Modular curves and codes with a polynomial construction · IEEE Trans. Inf. Theory 1984
Coding theory
error-correcting codes		 0.011981
Linear unequal error protection codes · IEEE Trans. Inf. Theory 1981
Coding theory › error-correcting codes
unequal error protection codes		 0.011981
Linear unequal error protection codes · IEEE Trans. Inf. Theory 1981
Coding theory › error-correcting codes › coding bounds
asymptotic bounds		 0.011984
Modular curves and codes with a polynomial construction · IEEE Trans. Inf. Theory 1984
Coding theory › error-correcting codes › block codes
linear code		 0.011981
Linear unequal error protection codes · IEEE Trans. Inf. Theory 1981

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

majority decoding · 0.0iterative and concatenated codes · 0.0
YearPublicationVenuePosition
1984 Modular curves and codes with a polynomial construction
abstract
In this paper we studyq-ary codes arising from modular curvesX_{0}(11l)over GF(p^{2})and some binary codes attached to them. All these codes have a polynomial construction and have "good" asymptotic parameters: for certain values of the parameters theq-ary codes withq = p^{2} \geq 49are better than the Varshamov-Gilbert bound, and the binary codes are better than the Ziablov bounds.
G. L. Katsman, Michael A. Tsfasman, Serge G. Vladut
 IEEE Trans. Inf. Theory1
1981 Linear unequal error protection codes
abstract
The properties of linear codes over GF(q)that provide unequal error protection (UEP) of information digits are discussed. A design is proposed for optimal binary systematic linear UEP codes. Broad classes of iterative and concatenated UEP codes are constructed. Majority decoding algorithms for linear iterative UEP codes are described.
I. M. Boyarinov, G. L. Katsman
 IEEE Trans. Inf. Theory2