Metraipolis › archive › dc_d565ec4257c3
Gaussian Identification in MIMO Channels — arXiv:2610.22931
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.22931
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T09:39:52.055Z
- SHA-256 of the archived text
ed2d3cf2d3962e3ab0bf925be851a9102d4c3cd80e471d43f3619a0e7e02ac63- Stable URL of this page
https://metraipolis.com/documento/dc_d565ec4257c3
How to cite
Gaussian Identification in MIMO Channels — arXiv:2610.22931 — arXiv (en), https://arxiv.org/abs/2610.22931 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_d565ec4257c3 (Metraipolis archive dc_d565ec4257c3, sha256 ed2d3cf2d3962e3ab0bf925be851a9102d4c3cd80e471d43f3619a0e7e02ac63)
BibTeX
@misc{dcd565ec4257c3,
title = {Gaussian Identification in MIMO Channels — arXiv:2610.22931},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.22931},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_d565ec4257c3; sha256 ed2d3cf2d3962e3ab0bf925be851a9102d4c3cd80e471d43f3619a0e7e02ac63},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.22931. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
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 reliably identifiable messages can grow super-exponentially with blocklength $n,$ following $M_n(R)=2^{(n\log n)R},$ where $R$ is an achievable rate. The channel rank provides a spatial-multiplexing advantage, enabling higher achievable rates and, consequently, stronger super-exponential codebook growth. These results characterize the rank-dependent gain in achievable identification performance.
Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.IT, nuovi lavori del giorno).
Categorie arXiv: Information Theory (cs.IT).
Pagina del lavoro: https://arxiv.org/abs/2610.22931 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T09:35:29.695Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).