Jian-Guo Lei

dblp:53/2309 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2012
—ORCID · none

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
Combinatorics and discrete mathematics · 76% Coding theory · 24%

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

TopicWeightPapersLastEvidence papers
Combinatorics and discrete mathematics › combinatorial design
difference sets
0.222012
Constructions of Difference Systems of Sets From Finite Projective Geometry · IEEE Trans. Inf. Theory 2012
Constructions of Difference Systems of Sets and Disjoint Difference Families · IEEE Trans. Inf. Theory 2008
Combinatorics and discrete mathematics › finite geometry
finite projective geometry
0.112012
Constructions of Difference Systems of Sets From Finite Projective Geometry · IEEE Trans. Inf. Theory 2012
Coding theory
recursive construction
0.112012
Constructions of Difference Systems of Sets From Finite Projective Geometry · IEEE Trans. Inf. Theory 2012
Combinatorics and discrete mathematics › combinatorial design
difference families
0.112008
Constructions of Difference Systems of Sets and Disjoint Difference Families · IEEE Trans. Inf. Theory 2008

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

recursive construction · 0.1cyclic design construction · 0.1
YearPublicationVenuePosition
2012 Constructions of Difference Systems of Sets From Finite Projective Geometry
abstract
Difference systems of sets$(DSS{\rm s})$are combinatorial structures introduced by Levenshtein in connection with code synchronization. In this paper, some recursive constructions of$DSS{\rm s}$obtained from finite projective geometry are presented. As a consequence, new infinite families of optimal$DSS{\rm s}$are obtained.
Cui-Ling Fan, Jian-Guo Lei
IEEE Trans. Inf. Theory2
2008 Constructions of Difference Systems of Sets and Disjoint Difference Families
abstract
Difference systems of sets (DSSs) are combinatorial structures that are a generalization of cyclic difference sets and arise in connection with code synchronization. In this correspondence, we give some constructions of DSS from cyclic designs and get some infinite classes of optimal difference systems of sets.
Cui-Ling Fan, Jian-Guo Lei, Yanxun Chang
IEEE Trans. Inf. Theory2