This paper investigates the maximal secret communication rate over a wiretap channel
subject to reliability and secrecy constraints at a given blocklength. New achievability and …

This paper investigates the maximal secrecy rate over a wiretap channel subject to reliability
and secrecy constraints at a given blocklength. New achievability and converse bounds are …

The conventional channel resolvability refers to the minimum rate needed for an input
process to approximate the channel output distribution in total variation distance. In this …

We design a randomized scalar quantization scheme, where the quantization error is
independent of the source and follows any given unimodal distribution (eg Gaussian …

A perennial theme of information theory is to find new methods to determine the fundamental
limits of various communication systems, which potentially helps the engineers to find better …

This paper studies an information-theoretic one-shot variable-length secret key agreement
problem with public discussion. Let X and Y be jointly distributed random variables, each …

The broadcast channel (BC) with one common and two private messages with leakage
constraints is studied, where leakage rate refers to the normalized mutual information …

An analogy framework between wiretap channels (WTCs) and state-dependent point-to-
point channels with non-causal encoder channel state information (referred to as Gelfand …

A framework of analogy between wiretap channels (WTCs) and state-dependent point-to-
point channels with noncausal encoder channel state information (referred to as Gelfand …

A fundamental tool in network information theory is the covering lemma, which lower bounds
the probability that there exists a pair of random variables; among a given number of …