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

Ziad Ahmad

dblp:132/9039 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2015
—ORCID · unresolved

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.

Theoretical computer science
1 paper
Coding theory · 65% Information theory · 35%

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

TopicWeightPapersLastEvidence papers
Coding theory › multiuser coding
broadcast channel coding
0.212015
Concatenated Coding Using Linear Schemes for Gaussian Broadcast Channels With Noisy Channel Output Feedback · IEEE Trans. Commun. 2015
Coding theory
channel coding
0.212015
Concatenated Coding Using Linear Schemes for Gaussian Broadcast Channels With Noisy Channel Output Feedback · IEEE Trans. Commun. 2015
Coding theory › error-correcting codes
concatenated codes
0.212015
Concatenated Coding Using Linear Schemes for Gaussian Broadcast Channels With Noisy Channel Output Feedback · IEEE Trans. Commun. 2015
Information theory › network information theory › broadcast channel
gaussian broadcast channel
0.212015
Concatenated Coding Using Linear Schemes for Gaussian Broadcast Channels With Noisy Channel Output Feedback · IEEE Trans. Commun. 2015
Information theory
channel capacity
0.112015
Concatenated Coding Using Linear Schemes for Gaussian Broadcast Channels With Noisy Channel Output Feedback · IEEE Trans. Commun. 2015
Information theory › channel capacity
feedback capacity
0.112015
Concatenated Coding Using Linear Schemes for Gaussian Broadcast Channels With Noisy Channel Output Feedback · IEEE Trans. Commun. 2015

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

linear coding · 0.2concatenated coding design · 0.2
YearPublicationVenuePosition
2015 Concatenated Coding Using Linear Schemes for Gaussian Broadcast Channels With Noisy Channel Output Feedback
abstract
Linear coding schemes have been the main choice of coding for the additive white Gaussian noise broadcast channel (AWGN-BC) with noiseless feedback in the literature. The achievable rate regions of these schemes go well beyond the capacity region of the AWGN-BC without feedback. In this paper, a concatenated coding design for the K-user AWGN-BC with noisy feedback is proposed that relies on linear schemes as inner codes to achieve rate tuples outside the no-feedback capacity region. The boundary of an achievable rate region of purely linear coding schemes for noiseless feedback is shown to be arbitrarily closely approached by the concatenated coding scheme for sufficiently small feedback noise levels. Then, a linear coding scheme for the K-user symmetric AWGN-BC with noisy feedback is presented and optimized for use in the concatenated coding scheme. For noiseless feedback, the presented linear coding scheme achieves the optimal sum-rate of linear-feedback coding. An upper bound on the inner code blocklength needed to achieve a sum-rate above no-feedback sum-capacity is derived.
Ziad Ahmad, Zachary Chance, David J. Love, Chih-Chun Wang
IEEE Trans. Commun.1