List Decoding Random Euclidean Codes and Infinite Constellations

12 Jan 2019 Zhang Yihan Vatedka Shashank

We study the list decodability of different ensembles of codes over the real alphabet under the assumption of an omniscient adversary. It is a well-known result that when the source and the adversary have power constraints $ P $ and $ N $ respectively, the list decoding capacity is equal to $ \frac{1}{2}\log\frac{P}{N} $... (read more)

PDF Abstract
No code implementations yet. Submit your code now

Categories


  • INFORMATION THEORY
  • INFORMATION THEORY
  • METRIC GEOMETRY