VLDB 2026 Research / reviewers in the wild / expert

Michael A. Tsfasman

dblp:68/1445 · DBLP profile ↗
← Back
6ranked-venue papers
2as first author
0since 2021 · last 1995
—ORCID · none

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

Theory of computation · 6 · 2 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
4 papers
Coding theory · 96% Computational complexity · 4%

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

TopicWeightPapersLastEvidence papers
Coding theory › error-correcting codes
algebraic coding theory		 0.021995
Geometric approach to higher weights · IEEE Trans. Inf. Theory 1995
The weight hierarchy of higher dimensional Hermitian codes · IEEE Trans. Inf. Theory 1994
Coding theory
code weight		 0.011995
Geometric approach to higher weights · IEEE Trans. Inf. Theory 1995
Coding theory
generalized hamming weights		 0.011994
The weight hierarchy of higher dimensional Hermitian codes · IEEE Trans. Inf. Theory 1994
Coding theory › error-correcting codes › algebraic geometry code
hermitian codes		 0.011994
The weight hierarchy of higher dimensional Hermitian codes · IEEE Trans. Inf. Theory 1994
Coding theory › error-correcting codes › block codes › linear code › code parameters
weight hierarchy		 0.011994
The weight hierarchy of higher dimensional Hermitian codes · IEEE Trans. Inf. Theory 1994
Coding theory › error-correcting codes
coding bounds		 0.011986
A note on lower bounds · IEEE Trans. Inf. Theory 1986
Coding theory
error-correcting codes		 0.011986
A note on lower bounds · IEEE Trans. Inf. Theory 1986
Computational complexity
lower bounds		 0.011986
A note on lower bounds · IEEE Trans. Inf. Theory 1986
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
nonlinear codes		 0.011986
A note on lower bounds · IEEE Trans. Inf. Theory 1986
Coding theory › error-correcting codes › coding bounds
asymptotic bounds		 0.011984
Modular curves and codes with a polynomial construction · IEEE Trans. Inf. Theory 1984

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

projective systems over finite fields · 0.0algebraic geometric method · 0.0
YearPublicationVenuePosition
1995 Introduction to the special issue on algebraic geometry codes
Gilles Lachaud, Michael A. Tsfasman, Jørn Justesen, Victor K.-W. Wei
 IEEE Trans. Inf. Theory2
1995 Geometric approach to higher weights
abstract
The notion of higher (or generalized) weights of codes is just as natural as that of the classical Hamming weight. The authors adopt the geometric point of view and always treat the q-ary case. Some results and proofs being new, the main goal is to present a clear picture of what is known on the subject.
Michael A. Tsfasman, Serge G. Vladut
 IEEE Trans. Inf. Theory1
1994 The weight hierarchy of higher dimensional Hermitian codes
abstract
Studies a class of projective systems and linear codes corresponding to Hermitian varieties over finite fields. The weight hierarchy, also known as the set of generalized Hamming weights, of the code is calculated. The higher weight distribution is also found.>
James W. P. Hirschfeld, Michael A. Tsfasman, Serge G. Vladut
 IEEE Trans. Inf. Theory2
1991 Algebraic-geometric codes and asymptotic problems
Michael A. Tsfasman
 Discret. Appl. Math.1
1986 A note on lower bounds
abstract
A new lower bound for the parameters of (nonlinear)q-ary codes is introduced. For some q this bound improves on the Varshamov-Gilbert bound, the "modular" algebraic-geometric bound, and the very recent Vl\breve{a}duts bound.
Simon Litsyn, Michael A. Tsfasman
 IEEE Trans. Inf. Theory2
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. Theory2