Stealth Communication with Vanishing Power over Binary Symmetric Channels

05/13/2020
by   Diego Lentner, et al.
0

A framework for stealth communication with vanishing power (VP) is presented by studying binary symmetric channels. Coding theorems are proved by modifying Gallager's error exponents for VP and by applying resolvability exponents. The analysis unifies and generalizes existing rate bounds for covert and stealth communication.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/25/2019

One-shot achievability and converse bounds of Gaussian random coding in AWGN channels under covert constraints

This paper considers the achievability and converse bounds on the maxima...
research
11/30/2020

Minimax Converse for Identification via Channels

A minimax converse for the identification via channels is derived. By th...
research
05/12/2023

Achieving Capacity on Non-Binary Channels with Generalized Reed-Muller Codes

Recently, the authors showed that Reed-Muller (RM) codes achieve capacit...
research
12/14/2021

Simple Coding Techniques for Many-Hop Relaying

In this paper, we study the problem of relaying a single bit of informat...
research
04/05/2023

A proof that Reed-Muller codes achieve Shannon capacity on symmetric channels

Reed-Muller codes were introduced in 1954, with a simple explicit constr...
research
10/16/2022

Non-Transferability in Communication Channels and Tarski's Truth Theorem

This article aims to study transferability issues in communication chann...
research
08/31/2020

Coding Constructions for Efficient Oblivious Transfer from Noisy Channels

We consider oblivious transfer protocols performed over binary symmetric...

Please sign up or login with your details

Forgot password? Click here to reset