Demo Data from EDBT 2026 / reviewers in the wild / expert
Johannes Zangl
dblp:92/10899
· DBLP profile ↗
2ranked-venue papers
2as first author
0since 2021 · last 2005
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 2 · 2 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.
| Theoretical computer science
1 paper |
Coding theory · 100% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Coding theory › error-correcting codes › error probability analysis
bit-error probability |
0.0 | 1 | 2001 | Improved tangential sphere bound on the bit-error probability of concatenated codes · IEEE J. Sel. Areas Commun. 2001 |
Coding theory › error-correcting codes
concatenated codes |
0.0 | 1 | 2001 | Improved tangential sphere bound on the bit-error probability of concatenated codes · IEEE J. Sel. Areas Commun. 2001 |
Coding theory › channel coding
error probability bounds |
0.0 | 1 | 2001 | Improved tangential sphere bound on the bit-error probability of concatenated codes · IEEE J. Sel. Areas Commun. 2001 |
Coding theory › error-correcting codes › coding bounds
tangential sphere bound |
0.0 | 1 | 2001 | Improved tangential sphere bound on the bit-error probability of concatenated codes · IEEE J. Sel. Areas Commun. 2001 |
Coding theory
distance spectrum |
0.0 | 1 | 2001 | Improved tangential sphere bound on the bit-error probability of concatenated codes · IEEE J. Sel. Areas Commun. 2001 |
Coding theory › error-correcting codes › decoding › decoding algorithms › optimal decoding
maximum-likelihood decoding |
0.0 | 1 | 2001 | Improved tangential sphere bound on the bit-error probability of concatenated codes · IEEE J. Sel. Areas Commun. 2001 |
Methods — techniques the papers use, named apart from their topics
union bound analysis · 0.0simulation · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2005 | On the efficiency of channel coding in uncoordinated sensor networksabstractWe investigate the effect of channel coding on throughput and energy consumption in uncoordinated distributed (and) wireless networks, e.g. sensor networks. Although the redundancy associated with channel coding causes additional interference in this type of networks, we show that coding can decrease the frame error rate and increase the throughput. Furthermore, we introduce a new measure, which we call the energy based system efficiency. It relates the average throughput to the required transmission energy and allows prediction of the performance of certain coding schemes. Johannes Zangl, Joachim Hagenauer |
GLOBECOM | 1 |
| 2001 | Improved tangential sphere bound on the bit-error probability of concatenated codesabstractThe tangential sphere bound (TSB) of Poltyrev (1994) is a tight upper bound on the word error probability P/sub w/ of linear codes with maximum likelihood decoding and is based on the code's distance spectrum. An extension of the TSB to a bound on the bit-error probability P/sub b/ is given by Sason/Shitz (see IEEE Trans. Inform. Theory, vol.46, p.24-47, 2000). We improve the tangential sphere bound on P/sub b/ and apply the new method to some examples. Our comparison to other bounds as well as to simulation results shows an improved tightness, particularly for signal-to-noise ratios below the value corresponding to the computational cutoff rate R/sub o/. Johannes Zangl, Rupert Herzog |
IEEE J. Sel. Areas Commun. | 1 |