Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Karin Engdahl

dblp:03/6128 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2001
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 4 · 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.

Computer networks
3 papers
Physical-layer communications · 100%
Theoretical computer science
2 papers
Coding theory · 80% Information theory · 20%

Topics — the 17 heaviest of 17, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications › modulation
coded modulation		 0.122001
Asymptotical analysis and comparison of two coded modulation schemes using PSK signaling - Part II · IEEE Trans. Inf. Theory 2001
Asymptotical analysis and comparison of two coded modulation schemes using PSK signaling - Part I · IEEE Trans. Inf. Theory 2001
Physical-layer communications › modulation
phase-shift keying		 0.022001
Asymptotical analysis and comparison of two coded modulation schemes using PSK signaling - Part I · IEEE Trans. Inf. Theory 2001
Asymptotical analysis and comparison of two coded modulation schemes using PSK signaling - Part II · IEEE Trans. Inf. Theory 2001
Physical-layer communications › error probability analysis
error probability bounds		 0.012001
Asymptotical analysis and comparison of two coded modulation schemes using PSK signaling - Part I · IEEE Trans. Inf. Theory 2001
Physical-layer communications › modulation › coded modulation
multilevel coded modulation		 0.012001
Asymptotical analysis and comparison of two coded modulation schemes using PSK signaling - Part II · IEEE Trans. Inf. Theory 2001
Coding theory
channel coding		 0.012001
Tighter bounds on the error probability of fixed convolutional codes · IEEE Trans. Inf. Theory 2001
Coding theory › error-correcting codes
convolutional codes		 0.012001
Tighter bounds on the error probability of fixed convolutional codes · IEEE Trans. Inf. Theory 2001
Coding theory › channel coding
error probability bounds		 0.012001
Tighter bounds on the error probability of fixed convolutional codes · IEEE Trans. Inf. Theory 2001
Coding theory › error-correcting codes › decoding › decoding algorithms › optimal decoding
maximum-likelihood decoding		 0.012001
Tighter bounds on the error probability of fixed convolutional codes · IEEE Trans. Inf. Theory 2001
Physical-layer communications
error probability analysis		 0.011998
On the Calculation of the Error Probability for a Multilevel Modulation Scheme Using QAM-Signaling · IEEE Trans. Inf. Theory 1998
Physical-layer communications › modulation
quadrature amplitude modulation		 0.011998
On the Calculation of the Error Probability for a Multilevel Modulation Scheme Using QAM-Signaling · IEEE Trans. Inf. Theory 1998
Information theory
channel capacity		 0.011998
On the Calculation of the Error Probability for a Multilevel Modulation Scheme Using QAM-Signaling · IEEE Trans. Inf. Theory 1998
Coding theory › error-correcting codes › coded modulation
multilevel coding		 0.011998
On the Calculation of the Error Probability for a Multilevel Modulation Scheme Using QAM-Signaling · IEEE Trans. Inf. Theory 1998
Information theory › signal processing › modulation
multilevel modulation		 0.011998
On the Calculation of the Error Probability for a Multilevel Modulation Scheme Using QAM-Signaling · IEEE Trans. Inf. Theory 1998
Coding theory › error-correcting codes › decoding › decoding algorithms › decoding of block codes
multistage decoding		 0.011998
On the Calculation of the Error Probability for a Multilevel Modulation Scheme Using QAM-Signaling · IEEE Trans. Inf. Theory 1998
Physical-layer communications › channel modeling › gaussian channel
AWGN channel		 0.012001
Asymptotical analysis and comparison of two coded modulation schemes using PSK signaling - Part II · IEEE Trans. Inf. Theory 2001
Physical-layer communications
channel coding		 0.012001
Asymptotical analysis and comparison of two coded modulation schemes using PSK signaling - Part I · IEEE Trans. Inf. Theory 2001
Physical-layer communications › channel coding › error control coding
trellis codes		 0.012001
Asymptotical analysis and comparison of two coded modulation schemes using PSK signaling - Part I · IEEE Trans. Inf. Theory 2001

Methods — techniques the papers use, named apart from their topics

chernoff bound · 0.0
YearPublicationVenuePosition
2001 Asymptotical analysis and comparison of two coded modulation schemes using PSK signaling - Part I
abstract
An asymptotical analysis and comparison of two coded modulation systems using phase-shift keying (PSK) signaling with the transmission taking place over the additive white Gaussian noise (AWGN) channel is provided. In this paper, bounds for the decoding error probability of conventional coded modulation are derived. Both block and trellis coding are considered. The state-complexity error exponent is introduced.
Gerd Beyer, Karin Engdahl, Kamil Sh. Zigangirov
 IEEE Trans. Inf. Theory2
2001 Asymptotical analysis and comparison of two coded modulation schemes using PSK signaling - Part II
abstract
For pt.I see ibid., vol.47, no.7, p.2782-92 (2001). In this paper we analyze a multilevel coded modulation system using phase-shift keying (PSK) signaling and transmitting over the additive white Gaussian noise (AWGN) channel. We reduce the analysis of the overall system to the analysis of each decoding level, considering them as a set of related channels. The concept of a "genie-aided communication system" is introduced to simplify the analysis. A comparison with the conventional coded modulation system, studied in part I of this work, and some results concerning the synthesis and analysis of practical multilevel modulation schemes concludes the paper.
Gerd Beyer, Karin Engdahl, Kamil Sh. Zigangirov
 IEEE Trans. Inf. Theory2
2001 Tighter bounds on the error probability of fixed convolutional codes
abstract
We introduce new upper bounds for the bit and burst error probabilities, when a convolutional code is used for transmission over a binary input, additive white Gaussian noise (AWGN) channel, and the decoder performs maximum-likelihood decoding. The bounds are tighter than existing bounds, and nontrivial also for signal-to-noise ratios below the computational cutoff rate.
Karin Engdahl, Kamil Sh. Zigangirov
 IEEE Trans. Inf. Theory1
1998 On the Calculation of the Error Probability for a Multilevel Modulation Scheme Using QAM-Signaling
abstract
We analyze the quadrature amplitude modulation (QAM) version of multilevel modulation with multistage decoding using a suboptimal metric, when transmission takes place over a memoryless Gaussian channel. The upper bounds for decoding error probabilities are functions of the Chernoff bounding parameter Z. We argue that the conventional approximation of Z is not adequate; new values of Z that tightens the error bounds without causing them to lose their validity are given. The capacity for this system is also calculated, and we conclude that the use of a suboptimal metric in multistage decoding causes very little degradation in capacity compared to when the optimal metric is used in each decoding stage.
Karin Engdahl, Kamil Sh. Zigangirov
 IEEE Trans. Inf. Theory1