International audienceThis 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 lattice ensembles, the existence results in this paper are derived from number theory. It is shown that a multiblock construction based on division algebras achieves rates within a constant gap from block fading capacity both under maximum likelihood decoding and naive lattice decoding. First the gap to capacity is shown to depend on the discriminant of the chosen division algebra; then class field theory is applied to build families of algebras with small discriminants. The key ele...
Lattices possess elegant mathematical properties which have been previously used in the literature t...
We show that the codes from division algebras [1] achieve the optimal diversity-multiplexing tradeo....
In this paper we consider the diversity-multiplexing gain tradeoff (DMT) of so-called minimum delay ...
International audienceThis work addresses the question of achieving capacity with lattice codes in m...
We propose a coding scheme that achieves the capacity of the compound MIMO channel with algebraic la...
There is a rich theory of relations between lattices and linear codes over finite fields. However, t...
We propose a lattice coding scheme that achieves the capacity of the compound block-fading channel. ...
Abstract — We construct full-rank, rate-n Space-Time Block Codes (STBC), over any a priori specified...
We construct full-rank, rate-n space-time block codes (STBC), over any a priori specified signal set...
In this work we show that algebraic lattices con- structed from error-correcting codes achieve the e...
Thesis: S.M. in Computer Science and Engineering, Massachusetts Institute of Technology, Department ...
Wireless communication using multiple transmit and receive antennas is very effective when suitable ...
We present some general techniques for constructing full-rank, minimal-delay, rate at least one spac...
UnrestrictedThe broad objective of this thesis is to explore the fundamental limits of communication...
LDPC lattices were the first family of lattices which have an efficient decoding algorithm in high d...
Lattices possess elegant mathematical properties which have been previously used in the literature t...
We show that the codes from division algebras [1] achieve the optimal diversity-multiplexing tradeo....
In this paper we consider the diversity-multiplexing gain tradeoff (DMT) of so-called minimum delay ...
International audienceThis work addresses the question of achieving capacity with lattice codes in m...
We propose a coding scheme that achieves the capacity of the compound MIMO channel with algebraic la...
There is a rich theory of relations between lattices and linear codes over finite fields. However, t...
We propose a lattice coding scheme that achieves the capacity of the compound block-fading channel. ...
Abstract — We construct full-rank, rate-n Space-Time Block Codes (STBC), over any a priori specified...
We construct full-rank, rate-n space-time block codes (STBC), over any a priori specified signal set...
In this work we show that algebraic lattices con- structed from error-correcting codes achieve the e...
Thesis: S.M. in Computer Science and Engineering, Massachusetts Institute of Technology, Department ...
Wireless communication using multiple transmit and receive antennas is very effective when suitable ...
We present some general techniques for constructing full-rank, minimal-delay, rate at least one spac...
UnrestrictedThe broad objective of this thesis is to explore the fundamental limits of communication...
LDPC lattices were the first family of lattices which have an efficient decoding algorithm in high d...
Lattices possess elegant mathematical properties which have been previously used in the literature t...
We show that the codes from division algebras [1] achieve the optimal diversity-multiplexing tradeo....
In this paper we consider the diversity-multiplexing gain tradeoff (DMT) of so-called minimum delay ...