English
Related papers

Related papers: List Decoding for Oblivious Arbitrarily Varying MA…

200 papers

In this paper the cognitive interference channel with a common message, a variation of the classical cognitive interference channel in which the cognitive message is decoded at both receivers, is studied. For this channel model new outer…

Information Theory · Computer Science 2012-08-21 Stefano Rini , Carolin Huppert

Conflict-avoiding codes (CACs) have been used in multiple-access collision channel without feedback. The size of a CAC is the number of potential users that can be supported in the system. A code with maximum size is called optimal. The use…

Information Theory · Computer Science 2021-02-25 Chun-e Zhao , Wenping Ma , Tongjiang Yan , Yuhua Sun

In this work, we consider a covert communication scenario, where a transmitter Alice communicates to a receiver Bob with the aid of a probabilistic and uninformed jammer against an adversary warden's detection. The transmission status and…

Signal Processing · Electrical Eng. & Systems 2023-08-30 Xun Chen , Fujun Gao , Min Qiu , Jia Zhang , Feng Shu , Shihao Yan

A two-user symmetric Gaussian Interference Channel (IC) is considered in which a noiseless unidirectional link connects one encoder to the other. Having a constant capacity, the additional link provides partial cooperation between the…

Information Theory · Computer Science 2009-09-16 Hossein Bagheri , Abolfazl S. Motahari , Amir K. Khandani

We consider the asymmetric multilevel diversity (A-MLD) coding problem, where a set of $2^K-1$ information sources, ordered in a decreasing level of importance, is encoded into $K$ messages (or descriptions). There are $2^K-1$ decoders,…

Information Theory · Computer Science 2009-11-13 Soheil Mohajer , Chao Tian , Suhas N. Diggavi

We consider a state-dependent multiaccess channel (MAC) with state non-causally known to some encoders. We derive an inner bound for the capacity region in the general discrete memoryless case and specialize to a binary noiseless case. In…

Information Theory · Computer Science 2008-03-30 Shiva Prasad Kotagiri , J. Nicholas Laneman

This paper adds to the understanding of the capacity region of the Gaussian interference channel. To this end, the capacity region of the one-sided Gaussian interference channel is first fully characterized. This is accomplished by…

Information Theory · Computer Science 2015-09-22 Mojtaba Vaezi , H. Vincent Poor

We study the following one-way asymmetric transmission problem, also a variant of model-based compressed sensing: a resource-limited encoder has to report a small set $S$ from a universe of $N$ items to a more powerful decoder (server). The…

Data Structures and Algorithms · Computer Science 2018-07-30 Alexandr Andoni , Javad Ghaderi , Daniel Hsu , Dan Rubenstein , Omri Weinstein

Message Authentication Code or MAC, is a well-studied cryptographic primitive that is used in order to authenticate communication between two parties sharing a secret key. A Tokenized MAC or TMAC is a related cryptographic primitive,…

Quantum Physics · Physics 2025-01-28 Amit Behera , Or Sattath , Uriel Shinar

This paper considers a Gaussian multi-input multi-output (MIMO) wiretap channel with a legitimate transmitter, a legitimate receiver (Bob), an eavesdropper (Eve), and a cooperative jammer. All nodes may be equipped with multiple antennas.…

Information Theory · Computer Science 2024-07-03 Hao Xu , Kai-Kit Wong , Yinfei Xu , Giuseppe Caire

A single input multiple output (SIMO) multiple access channel, with a large number of transmitters sending symbols from a constellation to the receiver of a multi-antenna base station, is considered. The fundamental limits of joint decoding…

Information Theory · Computer Science 2014-04-10 Mainak Chowdhury , Andrea Goldsmith

The compute-and-forward framework permits each receiver in a Gaussian network to directly decode a linear combination of the transmitted messages. The resulting linear combinations can then be employed as an end-to-end communication…

Information Theory · Computer Science 2016-11-17 Bobak Nazer , Viveck Cadambe , Vasilis Ntranos , Giuseppe Caire

We study the multi-receiver wiretap channel with public and confidential messages. In this channel, there is a transmitter that wishes to communicate with two legitimate users in the presence of an external eavesdropper. The transmitter…

Information Theory · Computer Science 2011-06-22 Ersen Ekrem , Sennur Ulukus

Sparse superposition codes were recently introduced by Barron and Joseph for reliable communication over the AWGN channel at rates approaching the channel capacity. The codebook is defined in terms of a Gaussian design matrix, and codewords…

Information Theory · Computer Science 2017-03-14 Cynthia Rush , Adam Greig , Ramji Venkataramanan

We study the power versus distortion trade-off for the distributed transmission of a memoryless bi-variate Gaussian source over a two-to-one average-power limited Gaussian multiple-access channel. In this problem, each of two separate…

Information Theory · Computer Science 2016-11-17 Amos Lapidoth , Stephan Tinguely

We study the two-user Gaussian multiple-input multiple-output (MIMO) broadcast channel with common and confidential messages. In this channel, the transmitter sends a common message to both users, and a confidential message to each user…

Information Theory · Computer Science 2010-03-01 Ersen Ekrem , Sennur Ulukus

We introduce randomized Limited View (LV) adversary codes that provide protection against an adversary that uses their partial view of the communication to construct an adversarial error vector to be added to the channel. For a codeword of…

Information Theory · Computer Science 2013-03-13 Reihaneh Safavi-Naini , Pengwei Wang

Voice services over Adaptive Multi-user channels on One Slot (VAMOS) has been standardized as an extension to the Global System for Mobile Communications (GSM). The aim of VAMOS is to increase the capacity of GSM, while maintaining backward…

Information Theory · Computer Science 2013-10-15 Michael A. Ruder , Raimund Meyer , Frank Obernosterer , Hans Kalveram , Robert Schober , Wolfgang H. Gerstacker

A class of diamond networks is studied where the broadcast component is orthogonal and modeled by two independent bit-pipes. New upper and lower bounds on the capacity are derived. The proof technique for the upper bound generalizes…

Information Theory · Computer Science 2015-10-06 Shirin Saeedi Bidokhti , Gerhard Kramer

This paper considers the problem of securing a linear network coding system against an adversary that is both an eavesdropper and a jammer. The network is assumed to transport n packets from source to each receiver, and the adversary is…

Information Theory · Computer Science 2016-11-17 Danilo Silva , Frank R. Kschischang