Metraipolis › archive › dc_87cc651dbac4
Shaping and Finite-Blocklength Analysis of Quaternionic Alamouti-Type Codes — arXiv:2610.41693
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.41693
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T05:45:25.946Z
- SHA-256 of the archived text
01038fdabc408c0eb485b3849d94abb2d8bbd199f24c8768d1eeb1f1d4526129- Stable URL of this page
https://metraipolis.com/documento/dc_87cc651dbac4
How to cite
Shaping and Finite-Blocklength Analysis of Quaternionic Alamouti-Type Codes — arXiv:2610.41693 — arXiv (en), https://arxiv.org/abs/2610.41693 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_87cc651dbac4 (Metraipolis archive dc_87cc651dbac4, sha256 01038fdabc408c0eb485b3849d94abb2d8bbd199f24c8768d1eeb1f1d4526129)
BibTeX
@misc{dc87cc651dbac4,
title = {Shaping and Finite-Blocklength Analysis of Quaternionic Alamouti-Type Codes — arXiv:2610.41693},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.41693},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_87cc651dbac4; sha256 01038fdabc408c0eb485b3849d94abb2d8bbd199f24c8768d1eeb1f1d4526129},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.41693. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study finite $2\times2$ Alamouti-type space--time codes associated with classical maximal orders in definite quaternion algebras over $\mathbb Q$. For the family indexed by primes $q\equiv3\pmod4$, we prove that the Eisenstein case $q=3$ uniquely minimises the finite quotient-alphabet energy at fixed minimum lattice distance and alphabet size. This ordering holds for every integer $p\geq2$, including when the representatives and their common translation are jointly optimised, with an explicit positive gap for every $q>3$. For uniform finite inputs, we derive a controlled high-SNR expansion of the information variance and determine its limiting ratio to the mutual information deficit. The mutual information expansion specialises arbitrary input fading results and gives an explicit remainder. Standard random-coding and second-order achievability tools relate these quantities to reliability over independently faded Alamouti blocks. All alphabets preserve symbol-wise maximum-likelihood detection at the Alamouti level. Numerical energy, mutual information, and error-rate comparisons support the analysis. Centred comparisons with classical Alamouti, Golden, and Silver codes illustrate the trade-off between reliability, symbol rate, and decoding effort. 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.41693 — 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-11-03T05:32:32.021Z dalla pagina https://arxiv.org/list/math.IT/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).