EDBT 2026 Demo / reviewers in the wild / expert
Stephan M. Hladik
dblp:06/2642
· DBLP profile ↗
2ranked-venue papers
0as first author
0since 2021 · last 2002
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 2
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
2 papers |
Coding theory · 100% |
Topics — the 9 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes › decoding
decoding algorithms |
0.0 | 1 | 2002 | An optimal circular Viterbi decoder for the bounded distance criterion · IEEE Trans. Commun. 2002 |
Coding theory
trellis codes |
0.0 | 1 | 2002 | An optimal circular Viterbi decoder for the bounded distance criterion · IEEE Trans. Commun. 2002 |
Coding theory › error-correcting codes › convolutional codes › convolutional code decoding
viterbi decoding |
0.0 | 1 | 2002 | An optimal circular Viterbi decoder for the bounded distance criterion · IEEE Trans. Commun. 2002 |
Coding theory › error-correcting codes › convolutional codes
convolutional code decoding |
0.0 | 1 | 1998 | Tailbiting MAP Decoders · IEEE J. Sel. Areas Commun. 1998 |
Coding theory › error-correcting codes › decoding › decoding algorithms › optimal decoding
MAP decoding |
0.0 | 1 | 1998 | Tailbiting MAP Decoders · IEEE J. Sel. Areas Commun. 1998 |
Coding theory › error-correcting codes › decoding
trellis decoding |
0.0 | 1 | 1998 | Tailbiting MAP Decoders · IEEE J. Sel. Areas Commun. 1998 |
Coding theory
channel coding |
0.0 | 2 | 2002 | An optimal circular Viterbi decoder for the bounded distance criterion · IEEE Trans. Commun. 2002 Tailbiting MAP Decoders · IEEE J. Sel. Areas Commun. 1998 |
Coding theory › error-correcting codes › decoding › minimum distance decoding
bounded-distance decoding |
0.0 | 1 | 2002 | An optimal circular Viterbi decoder for the bounded distance criterion · IEEE Trans. Commun. 2002 |
Coding theory › error-correcting codes › decoding › iterative decoding › soft-input soft-output decoding
turbo decoding |
0.0 | 1 | 1998 | Tailbiting MAP Decoders · IEEE J. Sel. Areas Commun. 1998 |
Methods — techniques the papers use, named apart from their topics
maximum a posteriori decoding · 0.0eigenvector computation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2002 | An optimal circular Viterbi decoder for the bounded distance criterionabstractWe propose a Viterbi-type decoder for tailbiting trellis codes that works by traversing the tailbiting circle somewhat more than once. The traversal is the least possible for any bounded distance Viterbi decoder. Procedures are given that compute this minimum. Unlike previous decoders of the type, the new scheme does not suffer limit cycles or from pseudocodewords. The bit-error rate is compared to that of Bahl-Cocke-Jelinek-Raviv and maximum-likelihood decoding. John B. Anderson, Stephan M. Hladik |
IEEE Trans. Commun. | 2 |
| 1998 | Tailbiting MAP DecodersabstractWe extend the MAP decoding algorithm of Bahl et al. (1974) to the case of tail-biting trellis codes. An algorithm is given that is based on finding an eigenvector, and another that avoids this. Several examples are given. The algorithm has application to turbo decoding and source-controlled channel decoding. John B. Anderson, Stephan M. Hladik |
IEEE J. Sel. Areas Commun. | 2 |