arXiv (All)
open access
Polynomial-Time MIMO Detection at the Maximum-Likelihood Threshold
We prove that exact block recovery in the square Gaussian binary MIMO model can be achieved in polynomial time at the same first-order SNR threshold as exhaustive maximum-likelihood detection. Specifically, for $y=\sqrt{ρ/N}Hx^\star+w, \; x^\star\in\{\pm1\}^N,$ and independent standard Gaussian $H\i
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Gaussian Optimality of Energy-Constrained One-Shot Communication through Single-Mode Bosonic Gaussian Channels#985215
- Covert Communications over Enormous Fluid Antenna Systems (E-FAS): Impact of Channel Hardening on Detection#1128927
- Learning to Transmit Over Unknown Erasure Channels with Empirical Erasure Rate Feedback#793456
- Learning to Transmit Over Unknown Erasure Channels with Empirical Erasure Rate Feedback#789452
- Circular MIMO antenna with ML-based bandwidth and isolation prediction for 6G communications.#309103
Record · ID 1013999
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive