EDBT 2026 Demo / reviewers in the wild / expert
Baokun Ding
dblp:172/1186
· DBLP profile ↗
3ranked-venue papers
1as first author
0since 2021 · last 2018
0000-0001-8064-0523ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Security and privacy · 2 · 1 first-authorTheory of computation · 1
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 · 100% | |
| Computer networks
1 paper |
Optical networks · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes
code construction |
0.3 | 1 | 2018 | Asymptotically Optimal Optical Orthogonal Signature Pattern Codes · IEEE Trans. Inf. Theory 2018 |
Coding theory › finite fields
finite field construction |
0.3 | 1 | 2018 | Asymptotically Optimal Optical Orthogonal Signature Pattern Codes · IEEE Trans. Inf. Theory 2018 |
Coding theory › sequences › sequence design
optical orthogonal codes |
0.3 | 1 | 2018 | Asymptotically Optimal Optical Orthogonal Signature Pattern Codes · IEEE Trans. Inf. Theory 2018 |
Coding theory › sequences › sequence design › optical orthogonal codes
optical orthogonal signature pattern code |
0.3 | 1 | 2018 | Asymptotically Optimal Optical Orthogonal Signature Pattern Codes · IEEE Trans. Inf. Theory 2018 |
Optical networks
optical code-division multiple access |
0.1 | 1 | 2018 | Asymptotically Optimal Optical Orthogonal Signature Pattern Codes · IEEE Trans. Inf. Theory 2018 |
Methods — techniques the papers use, named apart from their topics
recursive construction · 0.7rational function construction · 0.7polynomial construction · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2018 | New constructions of MDS symbol-pair codes
Baokun Ding, Gennian Ge, Jun Zhang 0031, Tao Zhang 0030, Yiwei Zhang 0018 |
Des. Codes Cryptogr. | 1 |
| 2018 | Asymptotically Optimal Optical Orthogonal Signature Pattern CodesabstractOptical orthogonal signature pattern codes (OOSPCs) have played an important role in a novel type of optical code-division multiple-access network for 2-D image transmission. In this paper, we give four direct constructions for OOSPCs based on polynomials and rational functions over finite fields. We also use r -simple matrices to present a recursive construction for OOSPCs. These constructions yield new families of asymptotically optimal OOSPCs. Lijun Ji, Baokun Ding, Xin Wang 0065, Gennian Ge |
IEEE Trans. Inf. Theory | 2 |
| 2017 | A generalization of combinatorial designs and related codes
Jerod Michel, Baokun Ding |
Des. Codes Cryptogr. | 2 |