English
Related papers

Related papers: Number field lattices achieve Gaussian and Rayleig…

200 papers

This work addresses the question of achieving capacity with lattice codes in multi-antenna block fading channels when the number of fading blocks tends to infinity. A design criterion based on the normalized minimum determinant is proposed…

Information Theory · Computer Science 2015-07-28 Laura Luzzi , Roope Vehkalahti

This work addresses the question of achieving capacity with lattice codes in multi-antenna block fading channels when the number of fading blocks tends to infinity. In contrast to the standard approach in the literature which employs random…

Information Theory · Computer Science 2015-01-28 Laura Luzzi , Roope Vehkalahti

In the decades following Shannon's work, the quest to design codes for the additive white Gaussian noise (AWGN) channel led to the development of a rich theory, revealing a number of beautiful connections between information theory and…

Information Theory · Computer Science 2017-12-21 Laura Luzzi , Roope Vehkalahti

In this paper, a class of relay networks is considered. We assume that, at a node, outgoing channels to its neighbors are orthogonal, while incoming signals from neighbors can interfere with each other. We are interested in the multicast…

Information Theory · Computer Science 2016-11-17 Wooseok Nam , Sae-Young Chung , Yong H. Lee

The covert capacity is characterized for a non-coherent fast Rayleigh-fading wireless channel, in which a legitimate user wishes to communicate reliably with a legitimate receiver while escaping detection from a warden. It is shown that the…

Information Theory · Computer Science 2019-11-12 Mehrdad Tahmasbi , Anne Savard , Matthieu R. Bloch

Lattices possess elegant mathematical properties which have been previously used in the literature to show that structured codes can be efficient in a variety of communication scenarios, including coding for the additive white Gaussian…

Information Theory · Computer Science 2017-12-19 Lakshmi Natarajan , Yi Hong , Emanuele Viterbo

In this paper we show that any sequence of infinite lattice constellations which is good for the unconstrained Gaussian channel can be shaped into a capacity-achieving sequence of codes for the power-constrained Gaussian channel under…

Information Theory · Computer Science 2018-06-26 Antonio Campello , Daniel Dadush , Cong Ling

It has been shown recently that coding for the Gaussian Wiretap Channel can be done with nested lattices. A fine lattice intended to the legitimate user must be designed as a usual lattice code for the Gaussian Channel, while a coarse…

Information Theory · Computer Science 2010-12-21 Jean-Claude Belfiore , Frederique Oggier

Based on algebraic number theory we construct some families of rotated Dn-lattices with full diversity which can be good for signal transmission over both Gaussian and Rayleigh fading channels. Closed-form expressions for the minimum…

Number Theory · Mathematics 2011-11-17 Grasiele Cristiane Jorge , Agnaldo José Ferrari , Sueli Irene Rodrigues Costa

In this work, we consider a discrete-time stationary Rayleigh flat-fading channel with unknown channel state information at transmitter and receiver. The law of the channel is presumed to be known to the receiver. In addition, we assume the…

Information Theory · Computer Science 2011-03-03 Meik Dörpinghaus , Heinrich Meyr

We propose a coding scheme that achieves the capacity of the compound MIMO channel with algebraic lattices. Our lattice construction exploits the multiplicative structure of number fields and their group of units to absorb ill-conditioned…

Information Theory · Computer Science 2017-01-11 Antonio Campello , Cong Ling , Jean-Claude Belfiore

We develop a characterization of fading models, which assigns a number called logarithmic Jensen's gap to a given fading model. We show that as a consequence of a finite logarithmic Jensen's gap, approximate capacity region can be obtained…

Information Theory · Computer Science 2018-06-05 Joyson Sebastian , Can Karakus , Suhas Diggavi

In this paper, new probability bounds are derived for algebraic lattice codes. This is done by using the Dedekind zeta functions of the algebraic number fields involved in the lattice constructions. In particular, it is shown how to upper…

Information Theory · Computer Science 2013-04-19 Camilla Hollanti , Emanuele Viterbo , David Karpuk

The proposed research performs the capacity analysis of the wireless channel described by the fluctuating double-Rayleigh with the line-of-sight model. The closed-form analytical expressions for the conditional capacity (in the case of…

Information Theory · Computer Science 2022-11-23 Aleksey S. Gvozdarev

We study the properties of quantum stabilizer codes that embed a finite-dimensional protected code space in an infinite-dimensional Hilbert space. The stabilizer group of such a code is associated with a symplectically integral lattice in…

Quantum Physics · Physics 2008-02-19 Jim Harrington , John Preskill

In this paper we construct some families of rotated $D_n$-lattices with full diversity for any $n$. These lattices can be good for signal transmission over both Gaussian and Rayleigh fading channels. In order to get bounds for their minimum…

Number Theory · Mathematics 2017-09-19 Robson R. de Araujo , Grasiele C. Jorge

We study the throughput capacity region of the Gaussian multi-access (MAC) fading channel with perfect channel state information (CSI) at the receiver and at the transmitters, at low power regime. We show that it has a multidimensional…

Information Theory · Computer Science 2013-11-01 Zouheir Rezki , Mohamed-Slim Alouini

Unreliable fading wireless channels are the main challenge for strict performance guarantees in mobile communications. Diversity schemes including massive number of antennas, huge spectrum bands and multi-connectivity links are applied to…

Information Theory · Computer Science 2020-09-21 Karl-Ludwig Besser , Eduard A. Jorswieck

Recently, it has been shown that a quantize-map-and-forward scheme approximately achieves (within a constant number of bits) the Gaussian relay network capacity for arbitrary topologies. This was established using Gaussian codebooks for…

Information Theory · Computer Science 2015-03-17 Ayfer Ozgur , Suhas Diggavi

In this article, the design of secure lattice coset codes for general wireless channels with fading and Gaussian noise is studied. Recalling the eavesdropper's probability and information bounds, a variant of the latter is given from which…

Information Theory · Computer Science 2016-08-02 Amaro Barreal , Alex Karrila , David Karpuk , Camilla Hollanti
‹ Prev 1 2 3 10 Next ›