Demo Data from SIGIR 2026 / reviewers in the wild / expert
Katharyn E. Olson
dblp:122/6539
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1992
—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% | |
| Theoretical computer science
1 paper |
Coding theory · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Physical-layer communications › signal analysis › noise analysis › noise modeling
atmospheric noise channel |
0.0 | 1 | 1992 | Forward error correction for an atmospheric noise channel · IEEE Trans. Commun. 1992 |
Physical-layer communications
channel modeling |
0.0 | 1 | 1992 | Forward error correction for an atmospheric noise channel · IEEE Trans. Commun. 1992 |
Coding theory
error-correcting codes |
0.0 | 1 | 1992 | Forward error correction for an atmospheric noise channel · IEEE Trans. Commun. 1992 |
Coding theory › error-correcting codes
forward error correction |
0.0 | 1 | 1992 | Forward error correction for an atmospheric noise channel · IEEE Trans. Commun. 1992 |
Methods — techniques the papers use, named apart from their topics
markov chain modeling · 0.0interleaving · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1992 | Forward error correction for an atmospheric noise channelabstractModels for predicting the performance of error correcting codes on an atmospheric noise channel are presented and verified. Two Markov chains are used to model the memory of the atmospheric noise channel. The transition probabilities for these chains are derived from atmospheric noise error processes which were recorded at 306 kHz. The models are used to estimate the probability of codeword error, and these estimates are compared to codeword error rates which are obtained directly from the recorded error processes. The comparisons are made for the Golay code with a variety of bit interleaving depths, and a Reed-Solomon code with a variety of symbol interleaving depths. Both Markov channel models predict the actual performance of the codes with much greater accuracy than the binary symmetric channel. Results for binary convolutional codes are presented.> Katharyn E. Olson, Per K. Enge |
IEEE Trans. Commun. | 1 |