pith. sign in

arxiv: 1106.1017 · v2 · pith:NZQBV4ZKnew · submitted 2011-06-06 · 💻 cs.IT · math.IT

MMSE of "Bad" Codes

classification 💻 cs.IT math.IT
keywords codesmmsemaximumratecodeerrorfunctionlower
0
0 comments X
read the original abstract

We examine codes, over the additive Gaussian noise channel, designed for reliable communication at some specific signal-to-noise ratio (SNR) and constrained by the permitted minimum mean-square error (MMSE) at lower SNRs. The maximum possible rate is below point-to-point capacity, and hence these are non-optimal codes (alternatively referred to as "bad" codes). We show that the maximum possible rate is the one attained by superposition codebooks. Moreover, the MMSE and mutual information behavior as a function of SNR, for any code attaining the maximum rate under the MMSE constraint, is known for all SNR. We also provide a lower bound on the MMSE for finite length codes, as a function of the error probability of the code.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.