arXiv (All)
open access
Gaussian Identification in MIMO Channels
We study the identification capacity of discrete-time Gaussian multiple-input multiple-output (MIMO) channels under per-antenna, per-symbol peak-amplitude constraints. We establish upper and lower bounds on the identification capacity that scale linearly with the channel rank $r.$ The number of reli
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
- An Improved Lower Bound on Support Size of Capacity-Achieving Inputs for the Binomial Channel: Extended version#1216301
- An Improved Upper Bound on the Capacity of the Primitive Diamond Relay Channel#1249459
- The Sharp Dimension Bound in the Johnson--Lindenstrauss Lemma#662472
- The Sharp Dimension Bound in the Johnson--Lindenstrauss Lemma#661422
- Counterexample to a Proposed Capacity Characterization of the Relay Channel#1012894
Record · ID 1387220
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