activity
20062022
most citedCoordination Capacity

249 citations · 571 across the 42 of their papers we have counts for

collaborators
Showing 2010 · cs.ITShow all

6 papers · 2 filters

cs.IT2010

Extension of the Blahut-Arimoto algorithm for maximizing directed information

Iddo Naiss, Haim Permuter

We extend the Blahut-Arimoto algorithm for maximizing Massey's directed information. The algorithm can be used for estimating the capacity of channels with delayed feedback, where…

cs.IT2010★ 13 cited

To Feed or Not to Feed Back

Himanshu Asnani, Haim Permuter, Tsachy Weissman

We study the communication over Finite State Channels (FSCs), where the encoder and the decoder can control the availability or the quality of the noise-free feedback. Specifically…

cs.IT2010

Cascade, Triangular and Two Way Source Coding with degraded side information at the second user

Yeow Khiang Chia, Haim Permuter, Tsachy Weissman

We consider the Cascade and Triangular rate-distortion problems where the same side information is available at the source node and User 1, and the side information available at Us…

cs.IT2010★ 41 cited

Probing Capacity

Himanshu Asnani, Haim Permuter, Tsachy Weissman

We consider the problem of optimal probing of states of a channel by transmitter and receiver for maximizing rate of reliable communication. The channel is discrete memoryless (DMC…

cs.IT2010★ 5 cited

Message and state cooperation in multiple access channels

Haim Permuter, Shlomo, Shamai +1

We investigate the capacity of a multiple access channel with cooperating encoders where partial state information is known to each encoder and full state information is known to t…

cs.IT2010★ 1 cited

Cascade and Triangular Source Coding with Side Information at the First Two Nodes

Haim Permuter, Tsachy Weissman

We consider the cascade and triangular rate-distortion problem where side information is known to the source encoder and to the first user but not to the second user. We characteri…