EDBT 2026 Demo / reviewers in the wild / expert
Hairong Kong
dblp:67/6005
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2023
0000-0002-1047-2883ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 1 · 1 since 2021
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 |
Combinatorics and discrete mathematics · 56% Coding theory · 44% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Combinatorics and discrete mathematics
combinatorial design |
0.7 | 1 | 2023 | New Constructions of Optimal Optical Orthogonal Codes Based on Partitionable Sets and Almost Partitionable Sets · IEEE Trans. Inf. Theory 2023 |
Coding theory › sequences › sequence design
optical orthogonal codes |
0.7 | 1 | 2023 | New Constructions of Optimal Optical Orthogonal Codes Based on Partitionable Sets and Almost Partitionable Sets · IEEE Trans. Inf. Theory 2023 |
Combinatorics and discrete mathematics › combinatorial design
cyclic packing |
0.2 | 1 | 2023 | New Constructions of Optimal Optical Orthogonal Codes Based on Partitionable Sets and Almost Partitionable Sets · IEEE Trans. Inf. Theory 2023 |
Methods — techniques the papers use, named apart from their topics
recursive construction · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | New Constructions of Optimal Optical Orthogonal Codes Based on Partitionable Sets and Almost Partitionable SetsabstractVariable-weight optical orthogonal codes (OOCs) were introduced by Yang for multimedia optical CDMA systems with multiple quality of service (QoS) requirements. In this paper, partitionable sets and almost partitionable sets are used to construct variable-weight OOCs. Four new recursive constructions for optimal cyclic packing are presented. Consequently, new infinite classes of optimal$(v,W,1,Q)$-OOCs are obtained. Hairong Kong |
IEEE Trans. Inf. Theory | 2 |