## Abstract

In [1] the authors suggested that in order to derive energy efficient space-time MMO codes from orders of the division algebras one should use maximal orders instead of natural ones.

They also described the division algebras that have the best maximal orders in terms of minimum determinant vs. average power. However, they were able to construct division algebras that were optimal only in few separate cases.

In this paper we are addressing this problem and giving an explicit construction for optimal division algebras of arbitrary degree in the case when the center is Q(i).

We note that all the results of this paper can be found from [2]. The goal of this paper is to give a simple representation of construction methods of [2].

Original language | English |
---|---|

Title of host publication | Proceedings of the 2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks |

Editors | T Helleseth, PV Kumar, O Ytrehus |

Publisher | IEEE |

Pages | 106-110 |

Number of pages | 5 |

ISBN (Print) | 978-1-4244-1199-3 |

DOIs | |

Publication status | Published - 2007 |

MoE publication type | A4 Article in a conference publication |

Event | IEEE Information Theory on Workshop Information Theory on Wireless Networks - Bergen, Norway Duration: 1 Jul 2007 → 6 Jul 2007 |

### Workshop

Workshop | IEEE Information Theory on Workshop Information Theory on Wireless Networks |
---|---|

Country | Norway |

City | Bergen |

Period | 01/07/2007 → 06/07/2007 |