Equal-image-size source partitioning: Creating strong Fano's inequalities for multi-terminal discrete memoryless channels

12/02/2015
by   Eric Graves, et al.
0

This paper introduces equal-image-size source partitioning, a new tool for analyzing channel and joint source-channel coding in a multi-terminal discrete memoryless channel environment. Equal-image-size source partitioning divides the source (combination of messages and codewords) into a sub-exponential number of subsets. Over each of these subsets, the exponential orders of the minimum image sizes of most messages are roughly equal to the same entropy term. This property gives us the strength of minimum image sizes and the flexibility of entropy terms. Using the method of equal-image-size source partitioning, we prove separate necessary conditions for the existence of average-error and maximum-error codes. These necessary conditions are much stronger than the standard Fano's inequality, and can be weakened to render versions of Fano's inequality that apply to codes with non-vanishing error probabilities. To demonstrate the power of this new tool, we employ the stronger average-error version of Fano's inequality to prove the strong converse for the discrete memoryless wiretap channel with decaying leakage, which heretofore has been an open problem.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/25/2014

Equating the achievable exponent region to the achievable entropy region by partitioning the source

In this paper we investigate the image size characterization problem. We...
research
01/25/2017

Wiretap channel capacity: Secrecy criteria, strong converse, and phase change

This paper employs equal-image-size source partitioning techniques to de...
research
01/15/2019

A New Inequality Related to Proofs of Strong Converse Theorems for Source or Channel Networks

In this paper we provide a new inequality useful for the proofs of stron...
research
09/06/2020

Multi-Way Number Partitioning: an Information-Theoretic View

The number partitioning problem is the problem of partitioning a given l...
research
05/08/2021

On Multi-Channel Huffman Codes for Asymmetric-Alphabet Channels

Zero-error single-channel source coding has been studied extensively ove...
research
04/27/2019

Decision Procedure for the Existence of Two-Channel Prefix-Free Codes

The Kraft inequality gives a necessary and sufficient condition for the ...
research
05/22/2023

Cohomology of open sets

If G is a finite abstract simplicial complex and K is a subcomplex of G ...

Please sign up or login with your details

Forgot password? Click here to reset