2000 character limit reached
Number field lattices achieve Gaussian and Rayleigh channel capacity within a constant gap
Published 17 Nov 2014 in cs.IT, math.IT, and math.NT | (1411.4591v2)
Abstract: This paper proves that a family of number field lattice codes simultaneously achieves a constant gap to capacity in Rayleigh fast fading and Gaussian channels. The key property in the proof is the existence of infinite towers of Hilbert class fields with bounded root discriminant. The gap to capacity of the proposed families is determined by the root discriminant. The comparison between the Gaussian and fading case reveals that in Rayleigh fading channels the normalized minimum product distance plays an analogous role to the Hermite invariant in Gaussian channels.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.