arXiv (All)
open access
Has MIMO decoding been proved hard from lattice problems?
Multiple-input multiple-output (MIMO) technology is fundamental to modern wireless communication. Physical layer security seeks to protect transmitted information by exploiting properties of the noisy communication channel. Dean and Goldsmith proposed a polynomial time reduction from lattice problem
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
- Anti-Localization Uplink Communications in Satellite-Terrestrial Systems#1063469
- Invitation to the Second Symposium on Problems in the Optimization of Data Communications Systems#131380
- Transport Layer Security Protocol Compression Methods#141939
- NP-hardness of ideal lattice problems#1109858
- Enhancing privacy preservation and integrity in IoT-enabled wireless sensor networks through novel advanced cryptographic techniques.#358462
Record · ID 971971
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