Demo Data from EDBT 2026 / reviewers in the wild / expert
Keebom Kang
dblp:66/3611
· 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% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Physical-layer communications › synchronization
frame synchronization |
0.0 | 1 | 1992 | Statistical properties of out-of-frame detection schemes for digital transmission systems · IEEE Trans. Commun. 1992 |
Physical-layer communications › error probability analysis
bit error rate analysis |
0.0 | 1 | 1992 | Statistical properties of out-of-frame detection schemes for digital transmission systems · IEEE Trans. Commun. 1992 |
Methods — techniques the papers use, named apart from their topics
markov chain first passage time analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1992 | Statistical properties of out-of-frame detection schemes for digital transmission systemsabstractThe importance of the misframe times for DS1 frame synchronization has often been addressed in designing and using network elements and mediation units. By extending the work of J. H. Eu and W. W. Rollins (1991), Markov chain first passage time analysis is used to derive higher moments of the misframe times in both random and burst error environments. This methodology is of great value in evaluating frame synchronization techniques for digital transmission systems. By experimenting with several out-of-frame detection schemes and reasonable values for bit error ratio (BER), it is shown that misframe times are always approximately exponentially distributed for all schemes.> Keebom Kang, Michael P. Bailey, Jai Hong Eu |
IEEE Trans. Commun. | 1 |