Demo Data from VLDB 2026 / reviewers in the wild / expert
Young-Mo Gu
dblp:94/11126
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1998
—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 |
Physical-layer communications · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes
coded modulation |
0.0 | 1 | 1998 | Set partitioning for multilevel codes on a Rayleigh-fading channel · IEEE Trans. Commun. 1998 |
Coding theory › error-correcting codes › coded modulation
multilevel coding |
0.0 | 1 | 1998 | Set partitioning for multilevel codes on a Rayleigh-fading channel · IEEE Trans. Commun. 1998 |
Coding theory
set partitioning |
0.0 | 1 | 1998 | Set partitioning for multilevel codes on a Rayleigh-fading channel · IEEE Trans. Commun. 1998 |
Physical-layer communications › fading channels
rayleigh fading |
0.0 | 1 | 1998 | Set partitioning for multilevel codes on a Rayleigh-fading channel · IEEE Trans. Commun. 1998 |
Methods — techniques the papers use, named apart from their topics
multistage decoding · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1998 | Set partitioning for multilevel codes on a Rayleigh-fading channelabstractOn a Rayleigh-fading channel, multilevel codes achieve larger Hamming distances than single-level codes at comparable decoder complexity and bandwidth efficiency by employing a multistage decoder. Typically, multilevel codes are designed using Ungerboeck's (1982) set partitioning. This results in a large path multiplicity that degrades the code performance significantly. In order to overcome the performance degradation, we propose a set partitioning method that greatly reduces the path multiplicity. Young-Mo Gu, Choong Woong Lee |
IEEE Trans. Commun. | 1 |