Demo Data from EDBT 2026 / reviewers in the wild / expert
Yuh-Lin Yao
dblp:118/6838
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1996
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1
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 · 67% Information theory · 33% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes › convolutional codes
convolutional code decoding |
0.0 | 1 | 1996 | Hidden Markov models for the burst error statistics of Viterbi decoding · IEEE Trans. Commun. 1996 |
Information theory › probability theory › stochastic processes › markov processes
hidden markov model |
0.0 | 1 | 1996 | Hidden Markov models for the burst error statistics of Viterbi decoding · IEEE Trans. Commun. 1996 |
Coding theory › error-correcting codes › convolutional codes › convolutional code decoding
viterbi decoding |
0.0 | 1 | 1996 | Hidden Markov models for the burst error statistics of Viterbi decoding · IEEE Trans. Commun. 1996 |
Methods — techniques the papers use, named apart from their topics
hidden markov model · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1996 | Hidden Markov models for the burst error statistics of Viterbi decodingabstractThe method of the hidden Markov model (HMM) is used to develop a faithful model for the burst error statistics of Viterbi decoding of convolutional codes. One of the advantages of building such a model is that it can be used to generate the output sequence with little cost and can provide a basis for studying other system parameters. The HMM developed generally performs better than the geometric model and, in most cases, better than the previously proposed Markov model, and it requires much fewer parameters than those of the Markov model for convolutional codes of large constraint length. Chi-Chao Chao, Yuh-Lin Yao |
IEEE Trans. Commun. | 2 |