Variable-Length Coding for Binary-Input Channels With Limited Stop Feedback

05/30/2022
by   Hengjie Yang, et al.
0

This paper focuses on the numerical evaluation of the maximal achievable rate of variable-length stop-feedback (VLSF) codes with m decoding times at a given message size and error probability for binary-input additive white Gaussian noise channel, binary symmetric channel, and binary erasure channel (BEC). Leveraging the Edgeworth and Petrov expansions, we develop tight approximations to the tail probability of length-n cumulative information density that are accurate for any blocklength n. We reduce Yavas et al.'s non-asymptotic achievability bound on VLSF codes with m decoding times to an integer program of minimizing the upper bound on the average blocklength subject to the average error probability, minimum gap, and integer constraints. We develop two distinct methods to solve this program. Numerical evaluations show that Polyanskiy's achievability bound for VLSF codes, which assumes m = ∞, can be approached with a relatively small m in all of the three channels. For BEC, we consider systematic transmission followed by random linear fountain coding. This allows us to obtain a new achievability bound stronger than a previously known bound and new VLSF codes whose rate further outperforms Polyanskiy's bound.

READ FULL TEXT
research
01/27/2022

Variable-Length Stop-Feedback Codes With Finite Optimal Decoding Times for BI-AWGN Channels

In this paper, we are interested in the performance of a variable-length...
research
07/26/2023

Systematic Transmission With Fountain Parity Checks for Erasure Channels With Stop Feedback

In this paper, we present new achievability bounds on the maximal achiev...
research
05/23/2016

A note on the expected minimum error probability in equientropic channels

While the channel capacity reflects a theoretical upper bound on the ach...
research
03/17/2021

Variable-length Feedback Codes with Several Decoding Times for the Gaussian Channel

We investigate variable-length feedback (VLF) codes for the Gaussian poi...
research
02/02/2019

Finite-Blocklength Performance of Sequential Transmission over BSC with Noiseless Feedback

In this paper, we consider the expected blocklength of variable-length c...
research
09/03/2019

Short-packet Transmission via Variable-Length Codes in the Presence of Noisy Stop Feedback

We present an upper bound on the error probability achievable using vari...
research
05/16/2023

Efficient Evaluation of the Probability of Error of Random Coding Ensembles

This paper presents an achievability bound that evaluates the exact prob...

Please sign up or login with your details

Forgot password? Click here to reset