Encoding Individual Source Sequences for the Wiretap Channel

12/15/2021
by   Neri Merhav, et al.
0

We consider the problem of encoding a deterministic source sequence (a.k.a.individual sequence) for the degraded wiretap channel by means of an encoder and decoder that can both be implemented as finite–state machines. Our first main result is a necessary condition for both reliable and secure transmission in terms of the given source sequence, the bandwidth expansion factor, the secrecy capacity, the number of states of the encoder and the number of states of the decoder. Equivalently, this necessary condition can be presented as a converse bound (i.e., a lower bound) on the smallest achievable bandwidth expansion factor. The bound is asymptotically achievable by Lempel-Ziv compression followed by good channel coding for the wiretap channel. Given that the lower bound is saturated, we also derive a lower bound on the minimum necessary rate of purely random bits needed for local randomness at the encoder in order to meet the security constraint. This bound too is achieved by the same achievability scheme. Finally, we extend the main results to the case where the legitimate decoder has access to a side information sequence, which is another individual sequence that may be related to the source sequence, and a noisy version of the side information sequence leaks to the wiretapper.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/19/2021

Conveying individual source sequences over memoryless channels using finite-state decoders with source side information

We study the following semi-deterministic setting of the joint source-ch...
research
03/23/2022

A Lower-bound for Variable-length Source Coding in LQG Feedback Control

In this letter, we consider a Linear Quadratic Gaussian (LQG) control sy...
research
06/26/2019

Guessing Individual Sequences: Generating Randomized Guesses Using Finite-State Machines

Motivated by earlier results on universal randomized guessing, we consid...
research
05/21/2020

Sharp Second-Order Pointwise Asymptotics for Lossless Compression with Side Information

The problem of determining the best achievable performance of arbitrary ...
research
02/21/2019

A Lower Bound on the Expected Distortion of Joint Source-Channel Coding

We consider the classic joint source-channel coding problem of transmitt...
research
04/17/2018

Asymptotic Achievable Rate of Two-Dimensional Constraint Codes based on Column by Column Encoding

In this paper, we propose a column by column encoding scheme suitable fo...
research
10/23/2022

Practical Implementation of Sequence Selection for Nonlinear Probabilistic Shaping

We propose two novel techniques to implement sequence selection (SS) for...

Please sign up or login with your details

Forgot password? Click here to reset