English
Related papers

Related papers: Rate Adaptation for Secure HARQ Protocols

200 papers

A polar code extension method which supports incremental redundancy hybrid ARQ(IR-HARQ) is proposed in this paper. By copying information bits to proper positions of the extend part, the extended polar code can give additional protection…

Information Theory · Computer Science 2017-09-01 Liang Ma , JieXiong , Yuejun Wei

This paper presents a novel type-II hybrid automatic repeat request (HARQ) transmission scheme which is based on pruned convolutional codes (CCs) and supports unequal error protection (UEP). The data to be transmitted is assumed to consist…

Information Theory · Computer Science 2015-09-30 Annabel Sharon Shitrit , Yonathan Murin , Ron Dabora , Osnat Keren

This paper investigates the usage of hybrid automatic repeat request (HARQ) protocols for power-efficient and reliable communications over free space optical (FSO) links. By exploiting the large coherence time of the FSO channel, the…

In this paper we address a sum secrecy rate maximization problem for a multi-carrier and MIMO communication system. We consider the case that the receiver is capable of full-duplex (FD) operation and simultaneously sends jamming signal to a…

Information Theory · Computer Science 2018-02-19 Tianyu Yang , Omid Taghizadeh , Rudolf Mathar

In this paper, inner and outer bounds on the capacity region of two-user interference channels with two confidential messages have been proposed. By adding secure multiplex coding to the error correction method in [15] which achieves the…

Information Theory · Computer Science 2015-03-19 Xiaolin Li , Ryutaroh Matsumoto

Inspired by emerging applications in vehicular networks, we address the problem of achieving high-reliability and low-latency communication in multi-hop wireless networks. We propose a new family of Automatic-Repeat-Requests (ARQs) based…

Information Theory · Computer Science 2022-08-09 Jaya Goel , J. Harshan

In this paper, we propose a transmission scheme that achieves information theoretic security, without making assumptions on the eavesdropper's channel. This is achieved by a transmitter that deliberately introduces synchronization errors…

Information Theory · Computer Science 2015-01-27 Jason Castiglione , Aleksandar Kavcic

This paper studies the problem of secure communcation over the two-receiver discrete memoryless broadcast channel with one-sided receiver side information and with a passive eavesdropper. We proposed a coding scheme which is based upon the…

Information Theory · Computer Science 2018-10-29 Jin Yeong Tan , Lawrence Ong , Behzad Asadi

A status updating communication system is examined, in which a transmitter communicates with a receiver over a noisy channel. The goal is to realize timely delivery of fresh data over time, which is assessed by an age-of-information (AoI)…

Information Theory · Computer Science 2019-05-09 Ahmed Arafa , Karim Banawan , Karim G. Seddik , H. Vincent Poor

Hybrid-ARQ protocols have become common in many packet transmission systems due to their incorporation in various standards. Hybrid-ARQ combines the normal automatic repeat request (ARQ) method with error correction codes to increase…

Information Theory · Computer Science 2015-05-27 Mayur Agrawal , Zachary Chance , David J. Love , Venkataramanan Balakrishnan

Wireless communication provides a wide coverage at the cost of exposing information to unintended users. As an information-theoretic paradigm, secrecy rate derives bounds for secure transmission when the channel to the eavesdropper is…

Information Theory · Computer Science 2016-11-17 Ashkan Kalantari , Mojtaba Soltanalian , Sina Maleki , Symeon Chatzinotas , Björn Ottersten

In this paper, we consider a scenario where a source node wishes to broadcast two confidential messages for two respective receivers, while a wire-tapper also receives the transmitted signal. This model is motivated by wireless…

Information Theory · Computer Science 2008-07-30 Ghadamali Bagherikaram , Abolfazl S. Motahari , Amir K. Khandani

Automatic repeat request (ARQ) is widely used in modern communication systems to improve transmission reliability. In conventional ARQ protocols developed for systems with energy-unconstrained receivers, an…

Information Theory · Computer Science 2016-11-17 Yuyi Mao , Jun Zhang , Khaled B. Letaief

Currently most progresses on quantum secret sharing suffer from rate-distance bound, and thus the key rates are limited. In addition to the limited key rate, the technical difficulty and the corresponding cost together prevent large-scale…

Quantum Physics · Physics 2023-10-09 Chen-Long Li , Yao Fu , Wen-Bo Liu , Yuan-Mei Xie , Bing-Hong Li , Min-Gang Zhou , Hua-Lei Yin , Zeng-Bing Chen

Delay-reliability (D-R), and throughput-delay-reliability (T-D-R) tradeoffs in an ad hoc network are derived for single hop and multi-hop transmission with automatic repeat request (ARQ) on each hop. The delay constraint is modeled by…

Information Theory · Computer Science 2010-04-27 Rahul Vaze

This paper studies the problem of secure communication over a K-transmitter multiple access channel in the presence of an external eavesdropper, subject to a joint secrecy constraint (i.e., information leakage rate from the collection of K…

Information Theory · Computer Science 2017-01-24 Yanling Chen , O. Ozan Koyluoglu , A. J. Han Vinck

We consider a 1-to-$K$ communication scenario, where a source transmits private messages to $K$ receivers through a broadcast erasure channel, and the receivers feed back strictly causally and publicly their channel states after each…

Information Theory · Computer Science 2014-08-11 László Czap , Vinod M. Prabhakaran , Christina Fragouli , Suhas Diggavi

Hybrid automatic repeat 1 request (HARQ) is a key enabler for ultrareliable communications. This paper optimizes transmit power for the initial transmission and the subsequent retransmissions of HARQ with either incremental redundancy or…

Information Theory · Computer Science 2022-04-05 Kaiming Shen , Wei Yu , Xihan Chen , Saeed R. Khosravirad

In the presence of multiple senders, one of the simplest decoding strategies that can be employed by a receiver is successive decoding. In a successive decoding strategy, the receiver decodes the messages one at a time using the knowledge…

Information Theory · Computer Science 2012-07-04 Omar Fawzi , Ivan Savov

In this paper, we consider the broadcast channel with confidential messages and external eavesdroppers (BCCE), where a multi-antenna base station simultaneously communicates to multiple potentially malicious users, in the presence of…

Information Theory · Computer Science 2013-06-11 Giovanni Geraci , Sarabjot Singh , Jeffrey G. Andrews , Jinhong Yuan , Iain B. Collings
‹ Prev 1 3 4 5 6 7 10 Next ›