English
Related papers

Related papers: Nested Lattice Codes for Secure Bidirectional Rela…

200 papers

We consider the problem of polar coding for secure communications over the two-way wiretap channel, where two legitimate users communicate with each other simultaneously while a passive eavesdropper overhears a combination of their…

Information Theory · Computer Science 2017-06-23 Mengfan Zheng , Meixia Tao , Wen Chen , Cong Ling

Lattices possess elegant mathematical properties which have been previously used in the literature to show that structured codes can be efficient in a variety of communication scenarios, including coding for the additive white Gaussian…

Information Theory · Computer Science 2017-12-19 Lakshmi Natarajan , Yi Hong , Emanuele Viterbo

In this paper, we investigate joint relay and jammer selection in two-way cooperative networks, consisting of two sources, a number of intermediate nodes, and one eavesdropper, with the constraints of physical layer security. Specifically,…

Information Theory · Computer Science 2011-12-01 Jingchao Chen , Rongqing Zhang , Lingyang Song , Zhu Han , Bingli Jiao

We study the problem of achieving strong secrecy over wiretap channels at negligible cost, in the sense of maintaining the overall communication rate of the same channel without secrecy constraints. Specifically, we propose and analyze two…

Information Theory · Computer Science 2016-12-06 Remi A. Chou , Badri Vellambi , Matthieu Bloch , Joerg Kliewer

The many-to-one interference channel has received interest by virtue of embodying the essence of an interference network while being more tractable than the general K-user interference channel. In this paper, we introduce information…

Information Theory · Computer Science 2015-03-17 Xiang He , Aylin Yener

This paper considers secure communication in buffer-aided cooperative wireless networks in the presence of one eavesdropper, which can intercept the data transmission from both the source and relay nodes. A new max-ratio relaying protocol…

Information Theory · Computer Science 2020-05-18 Jiayu Zhou , Deli Qiao , Haifeng Qian

This paper investigates the benefits of cooperation and proposes a relay activation strategy for a large wireless network with multiple transmitters. In this framework, some nodes cooperate with a nearby node that acts as a relay, using the…

Information Theory · Computer Science 2016-11-17 Andrés Altieri , Leonardo Rey Vega , Pablo Piantanida , Cecilia Galarza

When multiple users share the same resource for physical layer cooperation such as relay terminals in their vicinities, this shared resource may not be always available for every user, and it is critical for transmitting terminals to know…

Information Theory · Computer Science 2015-12-02 Shih-Chun Lin , I-Hsiang Wang

A restricted two-way communication problem in a small fully-connected network is investigated. The network consists of three nodes, all having access to a common channel with half-duplex constraint. Two nodes want to establish a dialog…

Information Theory · Computer Science 2014-09-05 Manuel Stein

Channels of satellite communication are usually modeled as Rician fading channels with very large Rician factor or Gaussian channels. Therefore, when a legitimate user is close to an eavesdropping user, the legitimate channel is…

Information Theory · Computer Science 2018-08-16 Shuai Han , Xiangxue Tai , Weixiao Meng , Cheng Li

In this paper, we consider a more general four-terminal memoryless relay-eavesdropper channel with state information (REC-SI) and derive an achievable perfect secrecy rate for it. We suppose that the state information is non-causally…

Information Theory · Computer Science 2021-10-18 Nematollah Zarmehi

There are two main factors limiting the performance of quantum key distribution --- channel transmission loss and noise. Previously, a linear bound was believed to put an upper limit on the rate-transmittance performance. Remarkably, the…

Quantum Physics · Physics 2020-07-01 Pei Zeng , Weijie Wu , Xiongfeng Ma

Although user cooperation cannot improve the capacity of Gaussian two-way channels (GTWCs) with independent noises, it can improve communication reliability. In this work, we aim to enhance and balance the communication reliability in GTWCs…

Information Theory · Computer Science 2025-04-24 Junghoon Kim , Taejoon Kim , Anindya Bijoy Das , Seyyedali Hosseinalipour , David J. Love , Christopher G. Brinton

This paper investigates the performance of streaming codes in low-latency applications over a multi-link three-node relayed network. The source wishes to transmit a sequence of messages to the destination through a relay. Each message must…

Information Theory · Computer Science 2022-01-19 Gustavo Kasper Facenda , Elad Domanovitz , Ashish Khisti , Wai-Tian Tan , John Apostolopoulos

The two user Gaussian interference channel with a full-duplex relay is studied. By using genie aided approaches, two new upper bounds on the achievable sum-rate in this setup are derived. These upper bounds are shown to be tighter than…

Information Theory · Computer Science 2010-08-16 Anas Chaaban , Aydin Sezgin

Physical layer network coding (PNC) has been proposed for next generation networks. In this contribution, we investigate PNC schemes with embedded perfect secrecy by exploiting structured interference in relay networks with two users and a…

Information Theory · Computer Science 2016-02-02 David Karpuk , Arsenia Chorti

The problem of communicating a single message to a destination in presence of multiple relay nodes, referred to as cooperative unicast network, is considered. First, we introduce "Mixed Noisy Network Coding" (MNNC) scheme which generalizes…

Information Theory · Computer Science 2014-10-21 Arash Behboodi , Pablo Piantanida

Physical-layer network coding improves the throughput of the two-way relay channel by allowing multiple source terminals to transmit simultaneously to the relay. However, it is generally not feasible to align the phases of the multiple…

Information Theory · Computer Science 2013-02-27 Terry Ferrett , Matthew C. Valenti , Don Torrieri

Shannon showed that to achieve perfect secrecy in point-to-point communication, the message rate cannot exceed the shared secret key rate giving rise to the simple one-time pad encryption scheme. In this paper, we extend this work from…

Information Theory · Computer Science 2020-05-29 Hongchao Zhou , Abbas El Gamal

Suppose that there are $n$ Senders and $n$ Receivers. Our goal is to send long messages from Sender $i$ to Receiver $i$ such that no other receiver can retrieve the message intended for Receiver $i$. The task can easily be completed using…

Computational Complexity · Computer Science 2007-05-23 Vince Grolmusz
‹ Prev 1 8 9 10 Next ›