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

Jiayun Jiang

dblp:12/9924 · DBLP profile ↗
← Back
1ranked-venue papers
1as 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 · 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
1 paper
Coding theory · 67% Combinatorics and discrete mathematics · 33%

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

TopicWeightPapersLastEvidence papers
Combinatorics and discrete mathematics › combinatorial design
cyclic packing		 0.112011
General Constructions of Optimal Variable-Weight Optical Orthogonal Codes · IEEE Trans. Inf. Theory 2011
Coding theory › sequences › sequence design
optical orthogonal codes		 0.112011
General Constructions of Optimal Variable-Weight Optical Orthogonal Codes · IEEE Trans. Inf. Theory 2011
Coding theory › sequences › sequence design › optical orthogonal codes
variable-weight optical orthogonal code		 0.112011
General Constructions of Optimal Variable-Weight Optical Orthogonal Codes · IEEE Trans. Inf. Theory 2011

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

combinatorial construction · 0.1
YearPublicationVenuePosition
2011 General Constructions of Optimal Variable-Weight Optical Orthogonal Codes
abstract
Variable-weight optical orthogonal code (OOC) was introduced by Yang for multimedia optical CDMA systems with multiple quality of service (QoS) requirements. In this paper, four general constructions for optimal cyclic packings and optimal variable-weight OOCs are presented. Many new infinite classes of optimal (v, W,1,Q)-OOCs are obtained. New infinite classes of optimal (v, W,1,Q)-OOCs for |W| ≥ 4 are easily obtained by the constructions.
Jiayun Jiang, Dianhua Wu, Pingzhi Fan
 IEEE Trans. Inf. Theory1