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 VLDB 2026 / reviewers in the wild / expert

Yacov Gabbai

dblp:54/6504 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2006
—ORCID · none

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

Theory of computation · 1 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 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
Information theory · 67% Coding theory · 33%

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

TopicWeightPapersLastEvidence papers
Coding theory › channel coding
feedback communication		 0.112006
Achievable Rates for the Discrete Memoryless Relay Channel With Partial Feedback Configurations · IEEE Trans. Inf. Theory 2006
Information theory › communication channels › channel state information
partial feedback		 0.112006
Achievable Rates for the Discrete Memoryless Relay Channel With Partial Feedback Configurations · IEEE Trans. Inf. Theory 2006
Information theory › network information theory
relay channel		 0.112006
Achievable Rates for the Discrete Memoryless Relay Channel With Partial Feedback Configurations · IEEE Trans. Inf. Theory 2006

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

z relay channel analysis · 0.1gaussian channel analysis · 0.1
YearPublicationVenuePosition
2006 On the Discrete Memoryless Relay Channel with Relay-Transmitter Feedback
abstract
A coding technique is proposed for the discrete memoryless relay channel with noiseless feedback from relay to transmitter. The achievability result we obtain is analogous to a result proposed by Cover and El Gamal that combines cooperation and transmission of compressed data
Yacov Gabbai, Shraga I. Bross
 ISIT1
2006 Achievable Rates for the Discrete Memoryless Relay Channel With Partial Feedback Configurations
abstract
Achievable rates over the discrete memoryless relay channel with partial feedback configurations are proposed. Specifically, we consider partial feedback from the receiver to the sender as well as partial feedback from the relay to the sender. These achievable rates are calculated for the general Gaussian and the$Z$relay channels and are shown to improve on the known one-way achievable rates.
Yacov Gabbai, Shraga I. Bross
 IEEE Trans. Inf. Theory1