On exact asymptotics of the error probability in channel coding: symmetric channels

08/29/2019
by   Yücel Altuğ, et al.
0

The exact order of the optimal sub-exponentially decaying factor in the classical bounds on the error probability of fixed-length codes over a Gallager-symmetric discrete memoryless channel with and without ideal feedback is determined. Regardless of the availability of feedback, it is shown that the order of the optimal sub-exponential factor exhibits a dichotomy. Moreover, the proof technique is used to establish the third-order term in the normal approximation for symmetric channels, where a similar dichotomy is shown to exist.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/23/2023

Variable-Length Codes with Bursty Feedback

We study variable-length codes for point-to-point discrete memoryless ch...
research
02/09/2022

Efficiently Computable Converses for Finite-Blocklength Communication

This paper presents a method for computing a finite-blocklength converse...
research
05/11/2023

Correcting One Error in Non-Binary Channels with Feedback

In this paper, the problem of correction of a single error in q-ary symm...
research
01/16/2018

Bounds on the Effective-length of Optimal Codes for Interference Channel with Feedback

In this paper, we investigate the necessity of finite blocklength codes ...
research
03/02/2022

Third-order Analysis of Channel Coding in the Moderate Deviations Regime

The channel coding problem in the moderate deviations regime is studied;...
research
02/21/2019

Almost exact analysis of soft covering lemma via large deviation

This paper investigates the soft covering lemma under both the relative ...
research
04/23/2018

On capacities of the two-user union channel with complete feedback

The exact values of the optimal symmetric rate point in the Cover--Leung...

Please sign up or login with your details

Forgot password? Click here to reset