A4 Refereed article in a conference publication
Construction of MIMO MAC Codes Achieving the Pigeon Hole Bound
Authors: Toni Ernvall, Roope Vehkalahti
Publication year: 2012
Journal: IEEE International Symposium on Information Theory
Book title : IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY
Journal name in source: 2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT)
Journal acronym: IEEE INT SYMP INFO
First page : 21
Last page: 25
ISBN: 978-1-4673-2579-0
Abstract
This paper provides a general construction method for multiple-input multiple-output multiple access channel codes (MIMO MAC codes) that have so called generalized full rank property. The achieved constructions give a positive answer to the question whether it is generally possible to reach the so called pigeon hole bound, that is an upper bound for the decay of determinants of MIMO-MAC channel codes.
This paper provides a general construction method for multiple-input multiple-output multiple access channel codes (MIMO MAC codes) that have so called generalized full rank property. The achieved constructions give a positive answer to the question whether it is generally possible to reach the so called pigeon hole bound, that is an upper bound for the decay of determinants of MIMO-MAC channel codes.
UTU Research Portal