2000 character limit reached
Construction of MIMO MAC Codes Achieving the Pigeon Hole Bound
Published 3 Feb 2012 in math.RA, cs.IT, and math.IT | (1202.0675v1)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
