There is a rich theory of relations between lattices and linear codes over finite fields. However, this theory has been developed mostly with lattice codes for the Gaussian channel in mind. In particular, different versions of what is called Construction A have connected the Hamming distance of the linear code to the Euclidean structure of the lattice.
This paper concentrates on developing a similar theory, but for fading channel coding instead. First, two versions of Construction A from number fields are given. These are then extended to division algebra lattices. Instead of the Euclidean distance, the Hamming distance of the finite codes is connected to the product distance of the resulting lattices, that is the minimum product distance and the minimum determinant respectively.
|Title of host publication||IEEE International Symposium on Information Theory - Proceedings|
|Number of pages||5|
|Publication status||Published - 2014|
|MoE publication type||A4 Article in a conference publication|
|Event||IEEE International Symposium on Information Theory - Honolulu, United States|
Duration: 29 Jun 2014 → 4 Jul 2014
|Name||IEEE International Symposium on Information Theory|
|Conference||IEEE International Symposium on Information Theory|
|Period||29/06/2014 → 04/07/2014|