EDBT 2026 Demo / reviewers in the wild / expert
Andrew S. Park
dblp:19/11127
· 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.
| Computer networks
1 paper |
Physical-layer communications · 100% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Physical-layer communications
channel coding |
0.0 | 1 | 1998 | Throughput performance of an FHMA system with variable rate coding · IEEE Trans. Commun. 1998 |
Physical-layer communications › spread spectrum › frequency hopping
frequency-hopping multiple access |
0.0 | 1 | 1998 | Throughput performance of an FHMA system with variable rate coding · IEEE Trans. Commun. 1998 |
Physical-layer communications › channel coding › adaptive coding
variable rate coding |
0.0 | 1 | 1998 | Throughput performance of an FHMA system with variable rate coding · IEEE Trans. Commun. 1998 |
Physical-layer communications
fading channels |
0.0 | 1 | 1998 | Throughput performance of an FHMA system with variable rate coding · IEEE Trans. Commun. 1998 |
Physical-layer communications › fading channels
rayleigh fading |
0.0 | 1 | 1998 | Throughput performance of an FHMA system with variable rate coding · IEEE Trans. Commun. 1998 |
Methods — techniques the papers use, named apart from their topics
throughput bound analysis · 0.0reed-solomon codes · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1998 | Throughput performance of an FHMA system with variable rate codingabstractWe compare throughput bounds for a frequency-hopped multiple-access (FHMA) system employing variable rate as well as fixed rate coding (FRC). Nonfading as well as Rayleigh-fading channels are explored. The throughput bounds for the variable rate coding (VRC) schemes are based on the assumption that the number of active users in the system, m, is known at any time while the bounds for the FRC scheme assumes that the fixed code rate is optimized for the user population mean, /spl lambda/, where the population is assumed to be Poisson distributed. We present bounds for theoretical "perfect" codes which achieve the capacity as well as bounds for Reed-Solomon (RS) codes of practical block lengths. Finally, we show the dependence of a VRC scheme upon the accuracy of the estimates of m and present a general comparison of the gains of using VRC versus a realistic FRC scheme. Andrew S. Park, R. Michael Buehrer, Brian D. Woerner |
IEEE Trans. Commun. | 1 |