Refined Strong Converse for the Constant Composition Codes

02/26/2020
by   Hao-Chung Cheng, et al.
0

A strong converse bound for constant composition codes of the form P_e^(n)≥ 1- A n^-0.5(1-E_sc'(R,W,p)) e^-n E_sc(R,W,p) is established using the Berry-Esseen theorem through the concepts of Augustin information and Augustin mean, where A is a constant determined by the channel W, the composition p, and the rate R, i.e., A does not depend on the block length n.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/29/2019

A Simple Derivation of the Refined SPB for the Constant Composition Codes

A judicious application of the Berry-Esseen theorem via the concepts of ...
research
03/05/2022

Why Constant-Composition Codes Reduce Nonlinear Interference Noise

A time-domain perturbation model of the nonlinear Schrodinger equation i...
research
06/21/2022

Codebook Mismatch Can Be Fully Compensated by Mismatched Decoding

We consider an ensemble of constant composition codes that are subsets o...
research
04/03/2019

Arithmetic Coding Based Multi-Composition Codes for Bit-Level Distribution Matching

A distribution matcher (DM) encodes a binary input data sequence into a ...
research
07/08/2023

A Strong Composition Theorem for Junta Complexity and the Boosting of Property Testers

We prove a strong composition theorem for junta complexity and show how ...
research
04/30/2019

Polar Codes for the Deletion Channel: Weak and Strong Polarization

This paper presents the first proof of polarization for the deletion cha...
research
11/21/2020

Explainable Composition of Aggregated Assistants

A new design of an AI assistant that has become increasingly popular is ...

Please sign up or login with your details

Forgot password? Click here to reset