• TUCS Publication Series
• How to Publish in TUCS Series
• Publication Search
• Publication Graph
• Publication Input
• Publication Input Guide
• JuFo Browser

The Coding Gain of Real Matrix Lattices: Bounds and Existence Results

Roope Vehkalahti, The Coding Gain of Real Matrix Lattices: Bounds and Existence Results. IEEE Transactions on Information Theory 56, 4359 – 4366 , 2010.

Abstract:

The paper considers the question of the normalized minimum determinant (or asymptotic coding gain) of real matrix lattices. The coding theoretic motivation for such study arises, for example, from the questions considering multiple-input multiple-output (MIMO) ultra-wideband (UWB) transmission. At the beginning, totally general coding gain bounds for real MIMO lattice codes is given by translating the problem into geometric language. Then code lattices that are produced from division algebras are considered. By applying methods from the theory of central simple algebras, coding gain bounds for code lattices coming from orders of division algebras are given. Finally, it is proven that these bounds can be reached by using maximal orders. In the case of 2$,times,$ 2 matrix lattices, this existence result proves that the general geometric bound derived earlier can be reached

BibTeX entry:

@ARTICLE{jVehkalahti10a,
  title = {The Coding Gain of Real Matrix Lattices: Bounds and Existence Results},
  author = {Vehkalahti, Roope},
  journal = {IEEE Transactions on Information Theory},
  volume = {56},
  pages = {4359 – 4366 },
  year = {2010},
}

Belongs to TUCS Research Unit(s): FUNDIM, Fundamentals of Computing and Discrete Mathematics

Publication Forum rating of this publication: level 3

Edit publication