The Asymptotic Generalized Poor-Verdu Bound Achieves the BSC Error Exponent at Zero Rate

01/05/2020
by   Ling-Hua Chang, et al.
0

The generalized Poor-Verdu error lower bound for multihypothesis testing is revisited. Its asymptotic expression is established in closed-form as its tilting parameter grows to infinity. It is also shown that the asymptotic generalized bound achieves the error exponent (or reliability function) of the memoryless binary symmetric channel at zero coding rates.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/07/2020

Tightness of the Asymptotic Generalized Poor-Verdú Error Bound for the Memoryless Symmetric Channel

The generalized Poor-Verdú error lower bound for multihypothesis testing...
research
08/01/2014

A convergence and asymptotic analysis of the generalized symmetric FastICA algorithm

This contribution deals with the generalized symmetric FastICA algorithm...
research
10/13/2022

On the Reliability Function for a BSC with Noiseless Feedback at Zero Rate

We consider the transmission of nonexponentially many messages through a...
research
08/12/2019

A Lagrange-Dual Lower Bound to the Error Exponent Function of the Typical Random Code

A Lagrange-dual (Gallager-style) lower bound is derived for the error ex...
research
01/25/2021

Zero-rate reliability function for mismatched decoding

We derive an upper bound on the reliability function of mismatched decod...
research
11/23/2017

Gallager Bound for MIMO Channels: Large-N Asymptotics

The use of multiple antenna arrays in transmission and reception has bec...
research
05/23/2022

Estimation of the Hurst parameter from continuous noisy data

This paper addresses the problem of estimating the Hurst exponent of the...

Please sign up or login with your details

Forgot password? Click here to reset