Finite-Blocklength Analysis of Alamouti Codes over Eisenstein Integers

April 11, 2026 ยท Grace Period ยท + Add venue

โณ Grace Period
This paper is less than 90 days old. We give authors time to release their code before passing judgment.
Authors Juliana Souza, Yu-Chih Huang arXiv ID 2604.10137 Category cs.IT: Information Theory Citations 0
Abstract
We study a space--time block code from a maximal order in the definite quaternion algebra $(-1,-3)_{\Q}$. Its embedding into $\C^{2\times 2}$ yields an Alamouti--Eisenstein code over $\Z[w]$ with full diversity, orthogonality, and non-vanishing determinant. The underlying lattice is isomorphic to $\Z[w]^2$, while the embedded lattice has $A_2\oplus A_2$ geometry, yielding a hexagonal shaping gain. We compare it with the classical Alamouti code over $\Z[i]$ in terms of shaping, constellation-constrained mutual information, and finite-blocklength achievable rates, obtaining an asymptotic energy gain of about $0.79$~dB and a small but positive mutual-information gain. At the same SNR and rate, the Alamouti--Eisenstein design also improves short-packet reliability.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Information Theory