English
Related papers

Related papers: A Simplified Coding Scheme for the Broadcast Chann…

200 papers

Fundamental limits of secret-key agreement over reciprocal wireless channels are investigated. We consider a two-way block-fading channel where the channel gains in the forward and reverse links between the legitimate terminals are…

Information Theory · Computer Science 2012-11-08 Ashish Khisti

In this paper, a receiver algorithm consisting of differential transmission and a two-stage detection for a single-input multiple-output (SIMO) phase-noise channels is studied. Specifically, the phases of the QAM modulated data symbols are…

Information Theory · Computer Science 2015-09-14 M. Reza Khanzadi , Rajet Krishnan , Thomas Eriksson

Polar codes are introduced for discrete memoryless broadcast channels. For $m$-user deterministic broadcast channels, polarization is applied to map uniformly random message bits from $m$ independent messages to one codeword while…

Information Theory · Computer Science 2015-04-15 Naveen Goela , Emmanuel Abbe , Michael Gastpar

In this paper, we consider a scenario where a source node wishes to broadcast two confidential messages for two respective receivers via a Gaussian MIMO broadcast channel. A wire-tapper also receives the transmitted signal via another MIMO…

Information Theory · Computer Science 2009-10-19 Ghadamali Bagherikaram , Abolfazl S. Motahari , Amir K. Khandani

As semantic communication (SemCom) attracts growing attention as a novel communication paradigm, ensuring the security of transmitted semantic information over open wireless channels has become a critical issue. However, traditional…

Information Theory · Computer Science 2025-11-25 Weixuan Chen , Qianqian Yang , Shuo Shao , Zhiguo Shi , Jiming Chen , Xuemin , Shen

The cognitive interference channel with confidential messages is studied. Similarly to the classical two-user interference channel, the cognitive interference channel consists of two transmitters whose signals interfere at the two…

Information Theory · Computer Science 2007-10-11 Yingbin Liang , Anelia Somekh-Baruch , H. Vincent Poor , Shlomo Shamai , Sergio Verdu

We propose a joint source-channel-network coding scheme, based on compressive sensing principles, for wireless networks with AWGN channels (that may include multiple access and broadcast), with sources exhibiting temporal and spatial…

Information Theory · Computer Science 2011-10-04 Soheil Feizi , Muriel Medard

The broadcast channel with confidential messages is a well studied scenario from the theoretical standpoint, but there is still lack of practical schemes able to achieve some fixed level of reliability and security over such a channel. In…

Information Theory · Computer Science 2016-11-17 Marco Baldi , Nicola Maturo , Giacomo Ricciutelli , Franco Chiaraluce

In this paper, we propose a physical-layer rateless code for wireless channels. A novel rateless encoding scheme is developed to overcome the high error floor problem caused by the low-density generator matrix (LDGM)-like encoding scheme in…

Information Theory · Computer Science 2013-06-25 Shuang Tian , Yonghui Li , Mahyar Shirvanimoghaddam , Branka Vucetic

We construct an explicit quantum coding scheme which achieves a communication rate not less than the coherent information when used to transmit quantum information over a noisy quantum channel. For Pauli and erasure channels we also present…

Quantum Physics · Physics 2015-12-10 Joseph M. Renes , David Sutter , Frédéric Dupuis , Renato Renner

In this work, we propose a covert communication scheme where the transmitter attempts to hide its transmission to a full-duplex receiver, from a warden that is to detect this covert transmission using a radiometer. Specifically, we first…

Information Theory · Computer Science 2017-11-13 Jinsong Hu , Khurram Shahzad , Shihao Yan , Xiangyun Zhou , Feng Shu , Jun Li

This paper presents a recursive hiding scheme for 2 out of 3 secret sharing. In recursive hiding of secrets, the user encodes additional information about smaller secrets in the shares of a larger secret without an expansion in the size of…

Cryptography and Security · Computer Science 2009-02-17 Abhishek Parakh , Subhash Kak

In this paper, we discuss two-stage encoding algorithms capable of correcting a fraction of asymmetric errors. Suppose that the encoder transmits $n$ binary symbols $(x_1,\ldots,x_n)$ one-by-one over the Z-channel, in which a 1 is received…

Information Theory · Computer Science 2022-01-12 Alexey Lebedev , Vladimir Lebedev , Nikita Polyanskii

Polar codes have been proven to be capacity achieving for any binary-input discrete memoryless channel, while at the same time they can reassure secure and reliable transmission over the single-input single-output wireless channel. However,…

We investigate two source coding problems with secrecy constraints. In the first problem we consider real--time fully secure transmission of a memoryless source. We show that although classical variable--rate coding is not an option since…

Information Theory · Computer Science 2012-05-16 Yonatan Kaspi , Neri Merhav

In this paper the secrecy problem in the cognitive statedependent interference channel is considered. In this scenario we have a primary and a cognitive transmitter-receiver pairs. The cognitive transmitter has the message of the primary…

Information Theory · Computer Science 2012-08-23 Hamid G. Bafghi , Babak Seyfe

Recently, the physical layer security (PLS) of the communication systems has been shown to be enhanced by using legal receiver's feedback. The present secret key based feedback scheme mainly focuses on producing key from the feedback and…

Information Theory · Computer Science 2018-04-11 Bin Dai , Linman Yu , Zheng Ma

In modern wireless networks, interference is no longer negligible since each cell becomes smaller to support high throughput. The reduced size of each cell forces to install many cells, and consequently causes to increase inter-cell…

Information Theory · Computer Science 2012-09-19 Hyukjoon Kwon , Jungwon Lee , Inyup Kang

In this paper, the role of secret key with finite rate is studied to enhance the secrecy performance of the system when users are operating in interference limited scenarios. To address this problem, a 2-user Gaussian Z-IC with secrecy…

Information Theory · Computer Science 2021-05-20 Somalatha U , Parthajit Mohapatra

We consider the multiple-input multiple-output (MIMO) wiretap channel under a minimum receiver-side power constraint in addition to the usual maximum transmitter-side power constraint. This problem is motivated by energy harvesting…

Information Theory · Computer Science 2016-11-17 Karim Banawan , Sennur Ulukus