Construction of MIMO MAC Codes Achieving the Pigeon Hole Bound
Toni Ernvall, Roope Vehkalahti
TL;DR
This paper introduces a general construction method for MIMO MAC codes with full rank properties, demonstrating that the pigeon hole bound for determinant decay can be achieved in such codes.
Contribution
It provides a novel construction approach for MIMO MAC codes that attain the pigeon hole bound, addressing a key open question in the field.
Findings
Constructed MIMO MAC codes with generalized full rank property.
Demonstrated codes can reach the pigeon hole bound for determinant decay.
Confirmed the theoretical possibility of achieving optimal decay bounds.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.