English
Related papers

Related papers: Encoding Individual Source Sequences for the Wiret…

200 papers

Motivated in part by the problem of secure multicast distributed storage, we analyze secrecy rates for a channel in which two transmitters simultaneously multicast to two receivers in the presence of an eavesdropper. Achievable rates are…

Information Theory · Computer Science 2020-08-04 Hassan ZivariFard , Matthieu Bloch , Aria Nosratinia

This paper employs equal-image-size source partitioning techniques to derive the capacities of the general discrete memoryless wiretap channel (DM-WTC) under four different secrecy criteria. These criteria respectively specify requirements…

Information Theory · Computer Science 2018-02-16 Eric Graves , Tan F. Wong

A usual code for quantum wiretap channel requires an auxiliary random variable subject to the perfect uniform distribution. However, it is difficult to prepare such an auxiliary random variable. We propose a code that requires only an…

Quantum Physics · Physics 2016-09-28 Masahito Hayashi

We study privacy-aware communication over a wiretap channel using end-to-end learning. Alice wants to transmit a source signal to Bob over a binary symmetric channel, while passive eavesdropper Eve tries to infer some sensitive attribute of…

Information Theory · Computer Science 2022-02-15 Ecenaz Erdemir , Pier Luigi Dragotti , Deniz Gunduz

The K-receiver wiretap channel is a channel model where a transmitter broadcasts K independent messages to K intended receivers while keeping them secret from an eavesdropper. The capacity region of the K-receiver multiple-input…

Information Theory · Computer Science 2023-04-04 Yue Qi , Mojtaba Vaezi , H. Vincent Poor

Fundamental rate-distortion-perception (RDP) trade-offs arise in applications requiring maintained perceptual quality of reconstructed data, such as neural image compression. When compressed data is transmitted over public communication…

Information Theory · Computer Science 2026-04-23 Gustaf Åhlgren , Onur Günlü

A new applicable wiretap channel with separated side information is considered here which consist of a sender, a legitimate receiver and a wiretapper. In the considered scenario, the links from the transmitter to the legitimate receiver and…

Information Theory · Computer Science 2012-04-03 Hamid G. Bafghi , Babak Seyfe , Mahtab Mirmohseni , M. Reza Aref

The two-user broadcast channel (BC) with receivers connected by bidirectional cooperation links of finite capacities, known as conferencing decoders, is considered. A novel capacity region outer bound is established based on multiple…

Information Theory · Computer Science 2025-08-12 Reza K. Farsani , Wei Yu

We derive bounds on the noncoherent capacity of wide-sense stationary uncorrelated scattering (WSSUS) channels that are selective both in time and frequency, and are underspread, i.e., the product of the channel's delay spread and Doppler…

Information Theory · Computer Science 2016-11-15 Giuseppe Durisi , Ulrich G. Schuster , Helmut Bölcskei , Shlomo Shamai

The secrecy capacity of the type II wiretap channel (WTC II) with a noisy main channel is currently an open problem. Herein its secrecy-capacity is derived and shown to be equal to its semantic-security (SS) capacity. In this setting, the…

Information Theory · Computer Science 2016-08-18 Ziv Goldfeld , Paul Cuff , Haim H. Permuter

The rate regions of many variations of the standard and wire-tap channels have been thoroughly explored. Secrecy capacity characterizes the loss of rate required to ensure that the adversary gains no information about the transmissions.…

Information Theory · Computer Science 2018-06-27 Jake Perazzone , Eric Graves , Paul Yu , Rick Blum

We develop a communication-theoretic framework for privacy-aware and resilient decision making in cyber-physical systems under misaligned objectives between the encoder and the decoder. The encoder observes two correlated signals…

Signal Processing · Electrical Eng. & Systems 2025-06-10 Anju Anand , Emrah Akyol

A private compression design problem is studied, where an encoder observes useful data $Y$, wishes to compress it using variable length code and communicates it through an unsecured channel. Since $Y$ is correlated with private attribute…

Information Theory · Computer Science 2024-03-27 Amirreza Zamani , Tobias J. Oechtering , Deniz Gündüz , Mikael Skoglund

A likelihood encoder is studied in the context of lossy source compression. The analysis of the likelihood encoder is based on the soft-covering lemma. It is demonstrated that the use of a likelihood encoder together with the soft-covering…

Information Theory · Computer Science 2016-04-07 Eva C. Song , Paul Cuff , H. Vincent Poor

In this paper, we investigate the problem of secure broadcasting over block-fading channels with limited channel knowledge at the transmitter. More particularly, we analyze the effect of having imperfect channel state information (CSI) via…

Information Theory · Computer Science 2016-03-24 Amal Hyadi , Zouheir Rezki , Mohamed-Slim Alouini

A distributed lossy compression network with $L$ encoders and a decoder is considered. Each encoder observes a source and sends a compressed version to the decoder. The decoder produces a joint reconstruction of target signals with the mean…

Information Theory · Computer Science 2022-06-06 Siyao Zhou , Sadaf Salehkalaibar , Jingjing Qian , Jun Chen , Wuxian Shi , Yiqun Ge , Wen Tong

The secrecy rate region of wiretap interference channels with a multi-antenna passive eavesdropper is studied under receiver energy harvesting constraints. To stay operational in the network, the legitimate receivers demand energy alongside…

Information Theory · Computer Science 2019-03-01 Ali Kariminezhad , Zohaib Hassan Awan , Hendrik Vogt , Aydin Sezgin

Secure communication in a potentially malicious environment becomes more and more important. The arbitrarily varying wiretap channel (AVWC) provides information theoretical bounds on how much information can be exchanged even in the…

Information Theory · Computer Science 2022-04-15 Carsten Rudolf Janda , Moritz Wiese , Eduard A. Jorswieck , Holger Boche

In this article we focus on the problem of channel decoding in presence of a-priori information. In particular, assuming that the a-priori information reliability is not perfectly estimated at the receiver, we derive a novel analytical…

Information Theory · Computer Science 2007-11-14 Andrea Abrardo

We consider the discrete memoryless degraded broadcast channels with feedback. We prove that the error probability of decoding tends to one exponentially for rates outside the capacity region and derive an explicit lower bound of this…

Information Theory · Computer Science 2015-04-24 Yasutada Oohama
‹ Prev 1 8 9 10 Next ›