Construction of MIMO MAC Codes Achieving the Pigeon Hole Bound




Toni Ernvall, Roope Vehkalahti

2012

IEEE International Symposium on Information Theory

IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY

2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT)

IEEE INT SYMP INFO

21

25

978-1-4673-2579-0



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.



Last updated on 2024-26-11 at 23:21