Code spectrum and reliability function: Gaussian channel
Marat V. Burnashev
TL;DR
This paper introduces a novel method for upper bounding the channel reliability function via code spectrum, unifying low and high rate cases, improving existing bounds, and deriving a new sphere-packing bound.
Contribution
It presents a new approach that unifies the analysis of reliability bounds across different rate regimes and improves upon previous bounds including a new derivation of the sphere-packing bound.
Findings
Improved upper bounds on the channel reliability function.
Unified treatment of low and high rate cases.
New derivation of the sphere-packing bound.
Abstract
A new approach for upper bounding the channel reliability function using the code spectrum is described. It allows to treat both low and high rate cases in a unified way. In particular, the earlier known upper bounds are improved, and a new derivation of the sphere-packing bound is presented.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Wireless Communication Techniques · Coding theory and cryptography · Cryptographic Implementations and Security