The Method of Types for the AWGN Channel

07/25/2023
by   Sergey Tridenski, et al.
0

For the discrete-time AWGN channel with a power constraint, we give an alternative derivation of Shannon's sphere-packing upper bound on the optimal block error exponent and prove for the first time an analogous lower bound on the optimal correct-decoding exponent. The derivations use the method of types with finite alphabets of sizes depending on the block length n and with the number of types sub-exponential in n.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/08/2021

A Sphere-Packing Error Exponent for Mismatched Decoding

We derive a sphere-packing error exponent for coded transmission over di...
research
07/18/2022

Achievable error exponents of data compression with quantum side information and communication over symmetric classical-quantum channels

A fundamental quantity of interest in Shannon theory, classical or quant...
research
01/16/2020

Proof of Convergence for Correct-Decoding Exponent Computation

For a discrete memoryless channel with finite input and output alphabets...
research
03/15/2020

On Approximation, Bounding Exact Calculation of Block Error Probability for Random Codes

This paper presents a method to calculate the exact block error probabil...
research
01/21/2019

A Lower Bound on the Error Exponent of Linear Block Codes over the Erasure Channel

A lower bound on the maximum likelihood (ML) decoding error exponent of ...
research
02/26/2018

Timeliness in Lossless Block Coding

We examine lossless data compression from an average delay perspective. ...
research
10/01/2019

Noisy Guesses

We consider the problem of guessing a random, finite-alphabet, secret n-...

Please sign up or login with your details

Forgot password? Click here to reset