English
Related papers

Related papers: PEP Analysis of Selective Decode and Forward Proto…

200 papers

Satellite broadband services are critical infrastructures enabling advanced technologies to function in the most remote regions of the globe. However, status-quo services are often unencrypted by default and vulnerable to eavesdropping…

Cryptography and Security · Computer Science 2020-02-13 James Pavur , Martin Strohmeier , Vincent Lenders , Ivan Martinovic

We consider a communication problem in which the receiver must first detect the presence of an information packet and, if detected, decode the message carried within it. We present general nonasymptotic upper and lower bounds on the maximum…

Information Theory · Computer Science 2021-09-29 Alejandro Lancho , Johan Östman , Giuseppe Durisi

We provide a novel upper-bound on Witsenhausen's rate, the rate required in the zero-error analogue of the Slepian-Wolf problem; our bound is given in terms of a new information-theoretic functional defined on a certain graph. We then use…

Information Theory · Computer Science 2010-01-25 Benjamin G. Kelly , Aaron B. Wagner

The optimized effective potential (OEP) approach has so far mainly been used in benchmark studies and for the evaluation of band gaps. In this work, we extend the application of the OEP by determining the analytical ionic forces within the…

Materials Science · Physics 2024-09-13 Damian Contant , Maria Hellgren

This paper develops upper bounds on the end-to-end transmission capacity of multi-hop wireless networks. Potential source-destination paths are dynamically selected from a pool of randomly located relays, from which a closed-form lower…

Information Theory · Computer Science 2013-02-08 Yuxin Chen , Jeffrey G. Andrews

In this paper, we investigate the performance of the dual-hop free space optical (FSO) communication systems under the effect of strong atmospheric turbulence together with misalignment effects (pointing error). We consider a relay assisted…

Information Theory · Computer Science 2017-09-19 Neha Mishra , D. Sriram Kumar , Pranav Kumar Jha

We consider the discrete memoryless degraded broadcast channels. 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 exponent function.…

Information Theory · Computer Science 2015-04-23 Yasutada Oohama

An alternative or supplementary approach named as physical layer security has been proposed to afford an extra security layer on top of the conventional cryptography technique. In this paper, an overview of secrecy performance…

Information Theory · Computer Science 2020-12-15 Long Kong , Yun Ai , Lei Lei , Georges Kaddoum , Symeon Chatzinotas , Björn Ottersten

Index coded PSK modulation over an AWGN broadcast channel, for a given index coding problem (ICP) is studied. For a chosen index code and an arbitrary mapping (of broadcast vectors to PSK signal points), we have derived a decision rule for…

Information Theory · Computer Science 2017-03-10 Divya U. S. , B. Sundar Rajan

In contrast to a maximum-likelihood decoder, it is often desirable to use an incomplete decoder that can detect its decoding errors with high probability. One common choice is the bounded distance decoder. Bounds are derived for the total…

Information Theory · Computer Science 2012-07-26 Kenneth Andrews , Sam Dolinar

This paper investigates PASS-enabled downlink covert communication in the presence of distributed surveillance, where multiple wardens perform signal detection and fuse their local binary decisions via majority-voting rule. We consider a…

Information Theory · Computer Science 2026-01-13 Ji He

We develop an energy-efficient routing protocol in order to enhance the stability period of wireless sensor networks. This protocol is called weighted election protocol (WEP). It introduces a scheme to combine clustering strategy with chain…

Information Theory · Computer Science 2012-07-18 Md. Golam Rashed , M. Hasnat Kabir , Shaikh Enayet Ullah

Timely and efficient dissemination of server status is critical in compute-first networking systems, where user tasks arrive dynamically and computing resources are limited and stochastic. In such systems, the access point plays a key role…

Networking and Internet Architecture · Computer Science 2025-07-24 Jianpeng Qi , Chao Liu , Rui Wang , Junyu Dong , Yanwei Yu

In this paper, we investigate the performance of selection cooperation in the presence of imperfect channel estimation. In particular, we consider a cooperative scenario with multiple relays and amplify-and-forward protocol over frequency…

Information Theory · Computer Science 2011-01-05 Mehdi Seyfi , Sami Muhaidat , Jie Liang

Concatenated forward error correction is studied using an outer KP4 Reed-Solomon code with hard-decision decoding and inner single parity check (SPC) codes with Chase/Wagner soft-decision decoding. Analytical expressions are derived for the…

Information Theory · Computer Science 2023-05-18 Diego Lentner , Emna Ben Yacoub , Stefano Calabrò , Georg Böcherer , Nebojša Stojanović , Gerhard Kramer

Fully Encrypted Protocols (FEPs) have arisen in practice as a technique to avoid network censorship. Such protocols are designed to produce messages that appear completely random. This design hides communications metadata, such as version…

Cryptography and Security · Computer Science 2024-09-09 Ellis Fenske , Aaron Johnson

In this paper, we consider a functional decode and forward (FDF) multi-way relay network (MWRN) where a common user facilitates each user in the network to obtain messages from all other users. We propose a novel user pairing scheme, which…

Information Theory · Computer Science 2016-08-19 Shama N. Islam , Salman Durrani , Parastoo Sadeghi

This paper extends some approximation methods that are used to identify closed form Bit Error Rate (BER) expressions which are frequently utilized in investigation and comparison of performance for wireless communication systems in the…

Information Theory · Computer Science 2016-11-18 Tugcan Aktas , Ali Ozgur Yilmaz , Emre Aktas

This paper examines the properties of the lower and upper bounds established by Maurer, Ahlswede and Csiszar (MAC) for secret-key capacity in the case of channel probing over single-input and single-output (SISO) channels. Inspired by the…

Information Theory · Computer Science 2023-09-27 Yingbo Hua

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

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