Demo Data from EDBT 2026 / reviewers in the wild / expert
Yu-Chei Lin
dblp:61/9270
· DBLP profile ↗
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
Computer networks · 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 · 100% | |
| Computer networks
1 paper |
Optical networks · 100% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Optical networks
optical code-division multiple access |
0.1 | 1 | 2011 | Construction of Optimal 2D Optical Codes Using (n, w, 2, 2) Optical Orthogonal Codes · IEEE Trans. Commun. 2011 |
Coding theory › error-correcting codes
code construction |
0.1 | 1 | 2011 | Construction of Optimal 2D Optical Codes Using (n, w, 2, 2) Optical Orthogonal Codes · IEEE Trans. Commun. 2011 |
Coding theory › sequences › sequence design
optical orthogonal codes |
0.1 | 1 | 2011 | Construction of Optimal 2D Optical Codes Using (n, w, 2, 2) Optical Orthogonal Codes · IEEE Trans. Commun. 2011 |
Methods — techniques the papers use, named apart from their topics
quadratic congruence sequences · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2011 | Construction of Optimal 2D Optical Codes Using (n, w, 2, 2) Optical Orthogonal CodesabstractTwo-dimensional (2D) wavelength-time coding schemes have recently been studied for optical code-division multiple access. In this paper, we propose a new family of 2D codes, which use "synchronized" quadratic congruence sequences for wavelength hopping and (n, w, 2, 2) optical orthogonal codes for time spreading. The new 2D codes provide larger (asymptotically optimal) code cardinality than other 2D codes by relaxing the maximum cross-correlation function from one to two. Our study shows that the heavier code weight supported by our 2D codes results in better code performance than some of previously proposed 2D codes (of the maximum cross-correlation functions of one and two). The new codes potentially support more subscribers and heavier bursty asynchronous traffic with gradual performance degradation as traffic load increases. Yu-Chei Lin, Guu-chang Yang, Cheng-Yuan Chang, Wing C. Kwong |
IEEE Trans. Commun. | 1 |