Linear programming bounds for unitary space time codes
Jean Creignou (IMB), Herv\'e Diet (IMB)
TL;DR
This paper applies linear programming techniques to the space of unitary matrices to derive improved bounds for space-time codes based on diversity measures, supported by theoretical and numerical analysis.
Contribution
It introduces new linear programming bounds for unitary space-time codes, enhancing previous bounds with both theoretical insights and numerical results.
Findings
Improved bounds for diversity sum and product
Theoretical bounds surpass previous limits
Numerical results validate the new bounds
Abstract
The linear programming method is applied to the space of unitary matrices in order to obtain bounds for codes relative to the diversity sum and the diversity product. Theoretical and numerical results improving previously known bounds are derived.
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.
Taxonomy
TopicsAdvanced Optimization Algorithms Research · Coding theory and cryptography · graph theory and CDMA systems