pith. sign in

arxiv: 2604.10137 · v1 · submitted 2026-04-11 · 💻 cs.IT · math.IT

Finite-Blocklength Analysis of Alamouti Codes over Eisenstein Integers

Juliana Souza , Yu-Chih Huang This is my paper

Pith reviewed 2026-05-10 16:02 UTC · model grok-4.3

classification 💻 cs.IT math.IT
keywords Alamouti codesEisenstein integersspace-time block codesfinite blocklengthquaternion algebrahexagonal latticemutual informationenergy gain
0
0 comments X

The pith

An Alamouti code over Eisenstein integers delivers 0.79 dB energy gain and higher short-packet reliability than the Gaussian-integer version.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper constructs a space-time block code by embedding a maximal order from a quaternion algebra into two-by-two complex matrices. This produces an orthogonal design with full diversity and a lattice that forms a hexagonal pattern rather than a square one. The geometry reduces the average power needed to send symbols at a given minimum distance. Direct comparisons with the classical Alamouti code show both an asymptotic energy saving and a modest rise in mutual information. These advantages translate into lower error rates when packets are short and the signal-to-noise ratio is fixed.

Core claim

The embedding of the maximal order in the quaternion algebra into complex 2x2 matrices yields an Alamouti-Eisenstein code over the Eisenstein integers that possesses full diversity, orthogonality, and non-vanishing determinant. The underlying lattice is isomorphic to two copies of the Eisenstein integers, while the embedded version has A2 plus A2 geometry and therefore hexagonal shaping. Relative to the classical Alamouti code over the Gaussian integers, this produces an asymptotic energy gain of about 0.79 dB together with a small positive gain in constellation-constrained mutual information. At identical signal-to-noise ratio and rate the new design therefore improves achievable rates in t

What carries the argument

Embedding of the maximal order from the quaternion algebra into 2x2 complex matrices that produces an orthogonal space-time block code with non-vanishing determinant and A2 plus A2 hexagonal lattice geometry.

If this is right

  • At the same signal-to-noise ratio and transmission rate the new code lowers the error probability for short packets.
  • The code achieves an asymptotic energy saving of 0.79 dB compared with the classical Alamouti design.
  • Constellation-constrained mutual information is slightly higher than that of the Gaussian-integer version.
  • The hexagonal lattice geometry supplies a concrete reduction in average transmit power for the same minimum distance.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same embedding technique could be applied to other quaternion algebras to search for further shaping gains in space-time coding.
  • Finite-blocklength analysis methods used here provide a template for comparing other lattice-based codes under short-packet constraints.
  • Hexagonal lattice advantages observed in this setting may appear in related problems such as lattice coding for Gaussian channels.

Load-bearing premise

The chosen embedding of the quaternion order into matrices preserves orthogonality, full diversity, and the A2 lattice geometry that supplies the hexagonal shaping gain.

What would settle it

A simulation or measurement of packet error rates for short block lengths at fixed SNR and rate that shows equal or higher errors for the Eisenstein code than for the Gaussian code would disprove the claimed reliability improvement.

Figures

Figures reproduced from arXiv: 2604.10137 by Juliana Souza, Yu-Chih Huang.

Figure 1
Figure 1. Figure 1: shows the normal-approximation block error prob￾ability ε as a function of the rate R at Es/N0 = 22 dB for n ∈ {128, 256, 512, 1024} and M = 169 points. Solid curves correspond to the Alamouti–Eisenstein constellation, dashed curves to the classical Alamouti constellation. For every n, the Alamouti–Eisenstein curves lie below and to the right, indicating a better rate–reliability trade-off. For example, at… view at source ↗
read the original 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.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 3 minor

Summary. The manuscript constructs a space-time block code from the maximal order in the quaternion algebra (-1,-3)_Q and embeds it into C^{2x2} to obtain an Alamouti code over the Eisenstein integers Z[w]. It establishes that this code has full diversity, orthogonality, and non-vanishing determinant, with the embedded lattice possessing A2 ⊕ A2 geometry that yields a hexagonal shaping gain. The work compares this design to the classical Alamouti code over Z[i] in shaping gain, constellation-constrained mutual information, and finite-blocklength achievable rates, reporting an asymptotic energy gain of approximately 0.79 dB together with a small positive mutual-information gain and improved short-packet reliability at equal SNR and rate.

Significance. If the algebraic embedding and lattice claims hold, the paper supplies a concrete, parameter-free improvement to a standard space-time code by exploiting the geometry of Eisenstein integers. The explicit finite-blocklength comparison using standard information-theoretic bounds is a strength, as is the grounding of the 0.79 dB figure in the known shaping advantage of A2 over Z^2. The results are relevant to short-packet wireless design and illustrate how quaternion-algebra constructions can translate into measurable reliability gains without additional parameters.

major comments (2)
  1. [Quaternion embedding section] Quaternion embedding section: the claim that the embedding of the maximal order produces an A2 ⊕ A2 lattice with full diversity, orthogonality, and non-vanishing determinant is load-bearing for every subsequent comparison; the manuscript must supply the explicit matrix form of the embedding together with a direct verification (e.g., Gram matrix or determinant calculation) that the geometry is indeed hexagonal.
  2. [Finite-blocklength analysis section] Finite-blocklength analysis section: the reported improvement in short-packet reliability and the small positive mutual-information gain rest on the specific achievable-rate bounds employed; the exact bound (Polyanskiy-Poor-Verdú or normal approximation), blocklength values, target error probability, and any simulation parameters must be stated so that the numerical gains can be reproduced.
minor comments (3)
  1. [Abstract] Abstract: the phrase 'about 0.79 dB' should be accompanied by the precise numerical derivation or a reference to the standard formula for the normalized second moment of the A2 lattice.
  2. [Preliminaries] Notation: the symbol w (primitive cube root of unity) and the precise definition of the quaternion algebra should be introduced in the preliminaries before the embedding is discussed.
  3. [Figures] Figures: any plots comparing mutual information or finite-blocklength rates must include legends that clearly distinguish the two codes and, if Monte-Carlo results are shown, report the number of trials or confidence intervals.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading, positive assessment of significance, and constructive suggestions. We address each major comment below and will revise the manuscript to incorporate the requested clarifications and explicit verifications.

read point-by-point responses

  1. Referee: [Quaternion embedding section] Quaternion embedding section: the claim that the embedding of the maximal order produces an A2 ⊕ A2 lattice with full diversity, orthogonality, and non-vanishing determinant is load-bearing for every subsequent comparison; the manuscript must supply the explicit matrix form of the embedding together with a direct verification (e.g., Gram matrix or determinant calculation) that the geometry is indeed hexagonal.

    Authors: We agree that an explicit matrix representation and direct verification will strengthen the exposition. In the revised version we will insert the explicit embedding map from the maximal order of the quaternion algebra (-1,-3)_Q into C^{2×2}, followed by the Gram-matrix computation confirming the A2 ⊕ A2 hexagonal geometry. We will also include the direct algebraic verification of full diversity, orthogonality, and non-vanishing determinant for the embedded codewords. revision: yes

  2. Referee: [Finite-blocklength analysis section] Finite-blocklength analysis section: the reported improvement in short-packet reliability and the small positive mutual-information gain rest on the specific achievable-rate bounds employed; the exact bound (Polyanskiy-Poor-Verdú or normal approximation), blocklength values, target error probability, and any simulation parameters must be stated so that the numerical gains can be reproduced.

    Authors: We concur that reproducibility requires these parameters to be stated explicitly. The analysis employs the Polyanskiy–Poor–Verdú bound. In the revision we will add a dedicated paragraph listing the blocklengths considered, the target error probability, the precise form of the bound, and all simulation parameters used for the constellation-constrained mutual-information and finite-blocklength rate curves. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation self-contained

full rationale

The paper constructs the Alamouti-Eisenstein code via embedding of the maximal order in (-1,-3)_Q into C^{2x2}, states its diversity/orthogonality/NVD/A2⊕A2 properties directly from that algebraic object, and evaluates shaping gain, MI, and finite-blocklength rates using standard information-theoretic quantities and the known 0.79 dB A2-vs-Z^2 shaping gain. No equation or central claim reduces to a fitted parameter renamed as prediction, a self-referential definition, or a load-bearing self-citation chain; all comparisons rest on externally verifiable lattice geometry and established bounds.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claims rest on standard facts from algebraic number theory about quaternion algebras and lattice embeddings; no free parameters or invented entities are introduced in the abstract.

axioms (2)
  • domain assumption A maximal order in the definite quaternion algebra (-1,-3)_Q embeds into C^{2x2} to produce a code with full diversity, orthogonality, and non-vanishing determinant.
    Invoked directly in the abstract to define the Alamouti-Eisenstein code.
  • domain assumption The embedded lattice has A2⊕A2 geometry equivalent to Z[w]^2, yielding hexagonal shaping gain.
    Stated as the source of the reported energy and reliability improvements.

pith-pipeline@v0.9.0 · 5443 in / 1487 out tokens · 56236 ms · 2026-05-10T16:02:51.182677+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

34 extracted references · 34 canonical work pages

  1. [1]

    A simple transmit diversity technique for wireless commu- nications,

    S. Alamouti, “A simple transmit diversity technique for wireless commu- nications,”IEEE Journal on Selected Areas in Communications, vol. 16, no. 8, pp. 1451–1458, 1998

    work page 1998

  2. [2]

    Space-time block codes from orthogonal designs,

    V . Tarokh, H. Jafarkhani, and A. Calderbank, “Space-time block codes from orthogonal designs,”IEEE Transactions on Information Theory, vol. 45, no. 5, pp. 1456–1467, 1999

    work page 1999

  3. [3]

    Paulraj, R

    A. Paulraj, R. Nabar, and D. Gore,Introduction to Space–Time Wireless Communications. Cambridge, UK: Cambridge University Press, 2003

    work page 2003

  4. [4]

    Oggier, J.-C

    F. Oggier, J.-C. Belfiore, and E. Viterbo,Cyclic Division Algebras: A Tool for Space-Time Coding. Now Foundations and Trends, 2007

    work page 2007

  5. [5]

    Perfect space–time block codes,

    F. Oggier, G. Rekaya, J.-C. Belfiore, and E. Viterbo, “Perfect space–time block codes,”IEEE Transactions on Information Theory, vol. 52, no. 9, pp. 3885–3902, 2006

    work page 2006

  6. [6]

    Explicit space–time codes achieving the diversity–multiplexing gain tradeoff,

    P. Elia, K. Kumar, S. Pawar, P. Kumar, and H.-F. Lu, “Explicit space–time codes achieving the diversity–multiplexing gain tradeoff,” IEEE Transactions on Information Theory, vol. 52, no. 9, pp. 3869– 3884, 2006

    work page 2006

  7. [7]

    Maximal orders in the design of dense space-time lattice codes,

    C. Hollanti, J. Lahtonen, and H.-f. Lu, “Maximal orders in the design of dense space-time lattice codes,”IEEE Transactions on Information Theory, vol. 54, no. 10, pp. 4493–4510, 2008

    work page 2008

  8. [8]

    On the densest MIMO lattices from cyclic division algebras,

    R. Vehkalahti, C. Hollanti, J. Lahtonen, and K. Ranto, “On the densest MIMO lattices from cyclic division algebras,”IEEE Transactions on Information Theory, vol. 55, no. 8, pp. 3751–3780, 2009

    work page 2009

  9. [9]

    Power-efficient modulation formats in coherent transmission systems,

    E. Agrell and M. Karlsson, “Power-efficient modulation formats in coherent transmission systems,”J. Lightwave Technol., vol. 27, no. 22, pp. 5115–5126, Nov 2009. [Online]. Available: https: //opg.optica.org/jlt/abstract.cfm?URI=jlt-27-22-5115

    work page 2009

  10. [10]

    Karlsson and E

    M. Karlsson and E. Agrell,Power-Efficient Modulation Schemes. New York, NY: Springer New York, 2011, pp. 219–252

    work page 2011

  11. [11]

    Digital transmission with coherent four- dimensional modulation,

    G. Welti and J. Lee, “Digital transmission with coherent four- dimensional modulation,”IEEE Transactions on Information Theory, vol. 20, no. 4, pp. 497–502, 1974

    work page 1974

  12. [12]

    Codes for combined phase and ampli- tude modulated signals in a four-dimensional space,

    L. Zetterberg and H. Brandstrom, “Codes for combined phase and ampli- tude modulated signals in a four-dimensional space,”IEEE Transactions on Communications, vol. 25, no. 9, pp. 943–950, 1977

    work page 1977

  13. [13]

    Lattices from maximal orders into quaternion algebras,

    C. Alves and J.-C. Belfiore, “Lattices from maximal orders into quaternion algebras,”Journal of Pure and Applied Algebra, vol. 219, no. 4, pp. 687–702, 2015. [Online]. Available: https://www. sciencedirect.com/science/article/pii/S0022404914000942

    work page 2015

  14. [14]

    Multilevel lattice codes from Hurwitz quaternion integers,

    J. G. F. Souza, S. I. R. Costa, and C. Ling, “Multilevel lattice codes from Hurwitz quaternion integers,”IEEE Transactions on Information Theory, pp. 1–1, 2025

    work page 2025

  15. [15]

    Status report to TSG: Study on 6G radio (fs 6g radio),

    3GPP TSG RAN, “Status report to TSG: Study on 6G radio (fs 6g radio),” 3GPP, Baltimore, US, TDoc RP-253877, Dec. 2025, 3GPP TSG RAN Meeting #110; Agenda item 8.2.2; Unique ID 1080072. [Online]. Available: https://portal.3gpp.org/ngppapp/TdocList. aspx?meetingId=60581

    work page 2025

  16. [16]

    Recommendation ITUR M ˙21600: Framework and overall objectives of the future development of IMT for 2030 and beyond,

    ITU-R, “Recommendation ITUR M ˙21600: Framework and overall objectives of the future development of IMT for 2030 and beyond,” International Telecommunication Union – Radiocommunication Sector, Tech. Rep. M.2160-0, Nov. 2023, accessed: 2025-12-

    work page 2030

  17. [17]

    Available: https://www.itu.int/dms pubrec/itu-r/rec/m/ R-REC-M.2160-0-202311-I-21-21PDF-E.pdf

    [Online]. Available: https://www.itu.int/dms pubrec/itu-r/rec/m/ R-REC-M.2160-0-202311-I-21-21PDF-E.pdf

    work page

  18. [18]

    Report ITU-R M.2516-0: Future technology trends of terrestrial international mobile telecommunications systems towards 2030 and beyond,

    ——, “Report ITU-R M.2516-0: Future technology trends of terrestrial international mobile telecommunications systems towards 2030 and beyond,” International Telecommunication Union – Radiocommunication Sector, Tech. Rep. M.2516-0, Nov. 2022, accessed: 2025-12-18. [Online]. Available: https: //www.itu.int/dms pub/itu-r/opb/rep/R-REP-M.2516-2022-PDF-E.pdf

    work page 2030

  19. [19]

    6G takes shape,

    J. G. Andrews, T. E. Humphreys, and T. Ji, “6G takes shape,”IEEE BITS the Information Theory Magazine, vol. 4, no. 1, pp. 2–24, 2024

    work page 2024

  20. [20]

    Channel coding rate in the finite blocklength regime,

    Y . Polyanskiy, H. V . Poor, and S. Verdu, “Channel coding rate in the finite blocklength regime,”IEEE Transactions on Information Theory, vol. 56, no. 5, pp. 2307–2359, 2010

    work page 2010

  21. [21]

    Short- packet communications over multiple-antenna Rayleigh-fading chan- nels,

    G. Durisi, T. Koch, J. ¨Ostman, Y . Polyanskiy, and W. Yang, “Short- packet communications over multiple-antenna Rayleigh-fading chan- nels,”IEEE Transactions on Communications, vol. 64, no. 2, pp. 618– 629, 2016

    work page 2016

  22. [22]

    Toward massive, ultrareliable, and low-latency wireless communication with short packets,

    G. Durisi, T. Koch, and P. Popovski, “Toward massive, ultrareliable, and low-latency wireless communication with short packets,”Proceedings of the IEEE, vol. 104, no. 9, pp. 1711–1726, 2016

    work page 2016

  23. [23]

    Performance analysis of short-packet non-orthogonal multiple access with Alamouti space-time block coding,

    L. Yuan, Z. Zheng, N. Yang, and J. Zhang, “Performance analysis of short-packet non-orthogonal multiple access with Alamouti space-time block coding,”IEEE Transactions on Vehicular Technology, vol. 70, no. 3, pp. 2900–2905, 2021

    work page 2021

  24. [24]

    Signal constellations based on Eisenstein integers for generalized spatial modulation,

    J. Freudenberger and S. Shavgulidze, “Signal constellations based on Eisenstein integers for generalized spatial modulation,”IEEE Commu- nications Letters, vol. 21, no. 3, pp. 556–559, Mar. 2017

    work page 2017

  25. [25]

    Embedded alamouti space-time codes for high rate and low decoding complexity,

    M. O. Sinnokrot, J. R. Barry, and V . K. Madisetti, “Embedded alamouti space-time codes for high rate and low decoding complexity,” in2008 42nd Asilomar Conference on Signals, Systems and Computers, 2008, pp. 1749–1753

    work page 2008

  26. [26]

    V oight,Quaternion algebras

    J. V oight,Quaternion algebras. Springer Nature, 2021

    work page 2021

  27. [27]

    Berhuy and F

    G. Berhuy and F. Oggier,An Introduction to Central Simple Algebras and Their Applications to Wireless Communication. USA: American Mathematical Society, 2013

    work page 2013

  28. [28]

    Space-time codes for high data rate wireless communication: performance criterion and code construction,

    V . Tarokh, N. Seshadri, and A. Calderbank, “Space-time codes for high data rate wireless communication: performance criterion and code construction,”IEEE Transactions on Information Theory, vol. 44, no. 2, pp. 744–765, 1998

    work page 1998

  29. [29]

    Tse and P

    D. Tse and P. Viswanath,Fundamentals of wireless communication. Cambridge university press, 2005

    work page 2005

  30. [30]

    Oggier and E

    F. Oggier and E. Viterbo,Algebraic Number Theory and Code Design for Rayleigh Fading Channels. Now Foundations and Trends, 2004

    work page 2004

  31. [31]

    Reiner,Maximal Orders

    I. Reiner,Maximal Orders. Oxford University Press, 01 2003

    work page 2003

  32. [32]

    N. J. Conway, J. H.; Sloane,Sphere packings, lattices and groups. Springer Science & Business Media, 2013, vol. 290

    work page 2013

  33. [33]

    Zamir,Lattice Coding for Signals and Networks: A Structured Cod- ing Approach to Quantization, Modulation, and Multiuser Information Theory

    R. Zamir,Lattice Coding for Signals and Networks: A Structured Cod- ing Approach to Quantization, Modulation, and Multiuser Information Theory. Cambridge University Press, 2014

    work page 2014

  34. [34]

    Short packets over block-memoryless fading channels: Pilot-assisted or noncoherent transmission?

    J. ¨Ostman, G. Durisi, E. G. Str ¨om, M. C. Cos ¸kun, and G. Liva, “Short packets over block-memoryless fading channels: Pilot-assisted or noncoherent transmission?”IEEE Transactions on Communications, vol. 67, no. 2, pp. 1521–1536, 2019

    work page 2019