betaFeedback

WorksComputer Science

Gaussian mass inequalities for lattices

Abstract

The Gaussian mass of a lattice is the evaluation of its theta series at a real nome and is relevant to lattice coding for the wiretap Gaussian channel. The ratio of the Gaussian mass of stable lattices to the Gaussian mass of the integer lattice was conjectured to be ≤1\le 1 (Regev et al., 2024). Kominers proved this bound recently for lattices obtained by Construction~A from binary self-dual codes. Building on Kominers' bound, we establish corresponding inequalities on average for Construction~A4A_4 lattices obtained from free self-dual quaternary codes and for Construction~A6A_6 lattices obtained from self-dual senary codes. We also prove the strict Gaussian-mass inequality for extremal unimodular lattices of both Type~II and Type~I. The Type~I result uses the Rains–Sloane definition of extremality. Its proof combines a universal theta truncation with an exact inversion of the shadow coefficients, and a Gaussian inequality for translated lattices. In addition, we obtain an averaging bound over the genus of Type~II lattices, and extend the binary Construction~A inequality to Siegel theta series of arbitrary genus, with further quaternary results under conditions on the residue code.

Introduction

Let LL be a lattice in Rn\mathbb{R}^n. Its theta series is defined by

ΘL(q)=∑x∈Lq(x,x),0<q<1,\Theta_L(q) = \sum_{x\in L} q^{(x,x)}, \quad0 < q < 1,

where (x,x)(x,x) is the Euclidean inner product. The Gaussian mass GL(t)G_L(t) of LL at tt is the real number obtained upon letting q=exp⁡(−t)q=\exp(-t) in θL(q)\theta_L(q). Applications of this invariant range from geometry of numbers [20], to computer science [16], to cryptography [3]. It was conjectured for stable lattices LL [20] that

∀t∈(0,∞),GL(t)≤GZn(t).\forall t \in(0,\infty),\quad G_L(t) \leq G_{\mathbb{Z}^n}(t).

In particular Kominers has shown in [14] that this bound holds for lattices LL obtained by Construction A from a binary code. The main tool in his proof is the connection between weight enumerator of the code, Jacobi modular forms and theta series of the lattice.

This question is related to the security of the wiretap Gaussian channel, and more generally to Physical Layer security, a paradigm where the inherent randomness of communication channels is leveraged to ensure security against an eavesdropper. In particular the secrecy gain [18] the maximum of the ratio GZn(t)/GL(t)G_{\mathbb{Z}^n}(t)/G_L(t) are of critical importance in that area. The Belfiore-Solé conjecture which states that the secrecy gain is achieved in the center of the fundamental domain is proved for most unimodular lattices in dimension <32<32 [10]. The lattices where a Kominers-like bound hold have a secrecy gain >1>1, a safe protection against an eavesdropper.

In this paper, we establish the following Gaussian-mass inequalities, in relation with the conjecture in [20].

  • Averaged inequalities hold for lattices arising from Construction A4A_4 over free self-dual quaternary codes and from Construction A6A_6 over self-dual Z6\mathbb{Z}_6-codes.

  • Extremal Type II lattices satisfy the strict pointwise inequality by an argument bearing on the zero location of some special modular forms [8]. We also bound the genus average of Type II lattices by the theta series of an orthogonal sum of copies of E8E_8.

  • Extremal Type I lattices satisfy the strict pointwise inequality in every dimension in which they exist, including the exceptional dimension-23 case in the Rains–Sloane bound [19]. The proof uses the shadow theta series and does not assume ss-extremality.

  • The binary Construction A inequality extends to genus-gg Siegel theta series via the genus-gg weight enumerators of [2]. We also obtain higher-

genus bounds for quaternary codes under conditions on their binary residues.

As usual the Type I result is harder to achieve, and more technical to derive than the Type II result and rely on shadow theory [6, 19]. Extremality of the lattice determines an initial truncation of the normalized theta series. A positive Bernstein-basis representation controls this truncation, while an exact coefficient inversion of the shadow expansion controls the remaining terms. Poisson summation on a translate of the lattice then gives a uniform estimate that completes the proof.

The paper is organized as follows. § 2 collects the preliminaries. § 3 relates quaternary weight enumerators to lattice theta series, and § 4 develops the averaging arguments for Constructions A4A_4 and A6A_6. § 5 treats extremal Type II lattices and their genus averages. § 6 proves the inequality for extremal Type I lattices. Finally, § 7 studies the higher-genus inequalities. § 8 concludes the article.

Preliminaries

We recall the basic notation concerning self-dual codes, Construction A lattices, Gaussian mass, extremal unimodular lattices, and higher-genus theta series.

Let M≥2M \ge2 and write ZM=Z/MZ\mathbb{Z}_M = \mathbb{Z}/M\mathbb{Z}. A linear code of length nn over ZM\mathbb{Z}_M is a ZM\mathbb{Z}_M-submodule C⊆ZMnC \subseteq\mathbb{Z}_M^n. Its dual code, with respect to the standard inner product, is C⊥={x∈ZMn:x⋅c=0(modM) for every c∈C}C^\perp= \{x \in\mathbb{Z}_M^n : x \cdot c = 0 \pmod{M}\text{ for every }c \in C\}. The code CC is called self-orthogonal if C⊆C⊥C \subseteq C^\perp, and self-dual if C=C⊥C = C^\perp. A code is called free of rank kk if it is isomorphic, as a ZM\mathbb{Z}_M-module, to ZMk\mathbb{Z}_M^k.

For a∈ZMa \in\mathbb{Z}_M, define its Euclidean weight by

wE(a)=min⁡{r2:r∈Z, r≡a(modM)},w_E(a) = \min\{r^2 : r \in\mathbb{Z},\ r \equiv a \pmod{M}\},

and, for c=(c1,…,cn)∈ZMnc = (c_1,\ldots,c_n) \in\mathbb{Z}_M^n, put wE(c)=∑i=1nwE(ci)w_E(c) = \sum_{i=1}^n w_E(c_i). For even MM, a self-dual code over ZM\mathbb{Z}_M is called Type II if wE(c)≡0(mod2M)w_E(c) \equiv0 \pmod{2M} for every c∈Cc \in C; otherwise it is called Type I. In particular, the divisibility conditions are modulo 8 over Z4\mathbb{Z}_4 and modulo 12 over Z6\mathbb{Z}_6.

For a linear code C⊆ZMnC \subseteq\mathbb{Z}_M^n, its Construction A lattice is

AM(C)=1M{x∈Zn:x mod M∈C},A_M(C) = \frac{1}{\sqrt{M}}\{x \in\mathbb{Z}^n : x \bmod M \in C\},

to simplify some formulas we let aM(C)=Ma_M(C)=\sqrt{M}. If CC is self-dual, then AM(C)A_M(C) is an integral unimodular lattice. If, in addition, CC is Type II, then AM(C)A_M(C) is even unimodular.

For a Z4\mathbb{Z}_4-code CC, its binary residue code is Res⁡(C)={c mod 2:c∈C}⊆F2n\operatorname{Res}(C)=\{c\bmod2:c\in C\}\subseteq\mathbb{F}_2^n. This binary code will be fixed in the averaging argument for free self-dual quaternary codes.

For modulus 66, the Chinese remainder theorem gives Z6≅F2×F3\mathbb{Z}_6\cong\mathbb{F}_2\times\mathbb{F}_3. Accordingly, a Z6\mathbb{Z}_6-code CC determines the binary and ternary components C2=C mod 2⊆F2nC_2=C\bmod2\subseteq\mathbb{F}_2^n, C3=C mod 3⊆F3nC_3=C\bmod3\subseteq\mathbb{F}_3^n. Conversely,

C={c∈Z6n:c mod 2∈C2, c mod 3∈C3}.C=\{c\in\mathbb{Z}_6^n:c\bmod2\in C_2,\ c\bmod3\in C_3\}.

Moreover, duality is compatible with the Chinese remainder decomposition, so that CC is self-dual if and only if both C2C_2 and C3C_3 are self-dual. This decomposition will be used in the averaging argument for Construction A6A_6.

For any finite ensemble E\mathcal{E} and any function FF on E\mathcal{E}, we use the notation

EX∈E[F(X)]=1∣E∣∑X∈EF(X).\mathbb{E}_{X\in\mathcal{E}}[F(X)]=\frac{1}{|\mathcal{E}|}\sum_{X\in\mathcal{E}}F(X).

The two averaging procedures considered later correspond to fixing the binary component and averaging over the ternary component.

Let L⊆RnL\subseteq\mathbb{R}^n be a positive-definite lattice. Its theta series is

ΘL(q)=∑x∈Lq(x,x),0<q<1.\Theta_L(q)=\sum_{x\in L}q^{(x,x)},\quad0<q<1.

We use the Jacobi theta function ϑ3(q)=∑m∈Zqm2\vartheta_3(q)=\sum_{m\in\mathbb{Z}}q^{m^2}. Thus ΘZn(q)=ϑ3(q)n\Theta_{\mathbb{Z}^n}(q)=\vartheta_3(q)^n. Equivalently, putting q=e−πtq=e^{-\pi t}, t>0t>0, one may write

GL(t)=ΘL(e−πt)=∑x∈Le−πt(x,x).G_L(t)=\Theta_L(e^{-\pi t})=\sum_{x\in L}e^{-\pi t(x,x)}.

This is the Gaussian mass of LL defined in the Introduction. The Gaussian-mass inequality considered throughout this paper is

ΘL(q)≤ϑ3(q)n,0<q<1.\Theta_L(q)\leq\vartheta_3(q)^n,\quad0<q<1.

Equivalently,

∑x∈Le−πt(x,x)≤(∑m∈Ze−πtm2)n,t>0.\sum_{x\in L}e^{-\pi t(x,x)}\leq\left(\sum_{m\in\mathbb{Z}}e^{-\pi t m^2}\right)^n,\quad t>0.

For lattices obtained by Construction A from binary self-dual codes, the corresponding inequality is known (see [14]). The purpose of the averaging results below is to establish analogous inequalities on average for Constructions A4A_4 and A6A_6.

For later use, we also recall the complete weight enumerator of a code C⊆ZMnC \subseteq\mathbb{Z}_M^n:

cwe⁡C(Xa:a∈ZM)=∑c∈C∏i=1nXci.\operatorname{cwe}_C\left(X_a : a \in\mathbb{Z}_M\right)=\sum_{c\in C}\prod_{i=1}^{n}X_{c_i}.

For a∈ZMa \in\mathbb{Z}_M, define the local theta function

ϕa(M)(q)=∑m∈Zq(a+Mm)2/M.\phi_a^{(M)}(q)=\sum_{m\in\mathbb{Z}}q^{(a+Mm)^2/M}.

By decomposing AM(C)A_M(C) into cosets of MZnM\mathbb{Z}^n, one obtains the standard Construction A identity

ΘAM(C)(q)=cwe⁡C(ϕa(M)(q):a∈ZM).\Theta_{A_M(C)}(q)=\operatorname{cwe}_C\left(\phi_a^{(M)}(q):a\in\mathbb{Z}_M\right).

In the quaternary case, if nj(c)n_j(c) denotes the number of coordinates of cc equal to jj, the symmetrized weight enumerator is

References

  1. [1]T. M. Apostol, Modular Functions and Dirichlet Series in Number Theory, 2nd ed., Graduate Texts in Mathematics, vol. 41, Springer, New York, 1990.
  2. [2]E. Bannai, S. T. Dougherty, M. Harada, and M. Oura, Type II codes, even unimodular lattices, and invariant rings, IEEE Trans. Inform. Theory 45 (1999), no. 4, 1194–1205.DOI
  3. [3]M. F. Bollauf, H.-Y. Lin, and O. Ytrehus, Secrecy gain of formally unimodular lattices from codes over the integers modulo 4, IEEE Trans. Inform. Theory 70 (2024), no. 5, 3309–3329.arxiv.org/abs/2303.08083
  4. [4]A. Bonnecaze, P. Solé, C. Bachoc, and B. Mourrain, Type II codes over Z₄, IEEE Trans. Inform. Theory 43 (1997), no. 3, 969–976.
  5. [5]Y. Choie and P. Solé, Self-dual codes over Z₄ and half-integral weight modular forms, Proc. Amer. Math. Soc. 130 (2002), no. 11, 3125–3131.DOI
  6. [6]J. H. Conway and N. J. A. Sloane, A note on optimal unimodular lattices, J. Number Theory 72 (1998), no. 2, 357–362.DOI
  7. [7]J. H. Conway and N. J. A. Sloane, Sphere Packings, Lattices and Groups, 3rd ed., Grundlehren der mathematischen Wissenschaften, vol. 290, Springer, New York, 1999.
  8. [8]W. Duke and P. Jenkins, On the zeros and coefficients of certain weakly holomorphic modular forms, Pure Appl. Math. Q. 4 (2008), no. 4, 1327–1340.DOI
  9. [9]J. Edmonds, Lehman’s switching game and a theorem of Tutte and Nash-Williams, J. Res. Nat. Bur. Stand. Sect. B 69B (1965), no. 1-2, 73–77.
  10. [10]A.-M. Ernvall-Hytönen, On a conjecture by Belfiore and Solé on some lattices, IEEE Trans. Inform. Theory 58 (2012), no. 9, 5950–5955.
  11. [11]P. Gaborit, A bound for certain s-extremal lattices and codes, Arch. Math. 89 (2007), no. 2, 143–151.DOI
  12. [12]Y. Kitaoka, Arithmetic of Quadratic Forms, 1st ed., Cambridge Tracts in Mathematics, vol. 106, Cambridge University Press, Cambridge, 1993.
  13. [13]S. D. Kominers, A sharp reverse Minkowski inequality for the Gaussian mass of integral unimodular lattices through rank 32, arXiv:2606.01347, 2026.arxiv.org/abs/2606.01347
  14. [14]S. D. Kominers, Majorization and Gaussian-mass maximality for Construction-A lattices from binary self-dual codes, arXiv:2606.03482, 2026.arxiv.org/abs/2606.03482
  15. [15]C. L. Mallows, A. M. Odlyzko, and N. J. A. Sloane, Upper bounds for modular forms, lattices, and codes, J. Algebra 36 (1975), no. 1, 68–76.DOI
  16. [16]D. Micciancio and O. Regev, Worst-case to average-case reductions based on Gaussian measures, SIAM J. Comput. 37 (2007), no. 1, 267–302.
  17. [17]F. W. J. Olver, D. W. Lozier, R. F. Boisvert, and C. W. Clark (eds.), 1st ed., NIST Handbook of Mathematical Functions, Cambridge University Press, New York, 2010.
  18. [18]F. Oggier, P. Solé, and J.-C. Belfiore, Lattice codes for the wiretap Gaussian channel: Construction and analysis, IEEE Trans. Inform. Theory 62 (2016), no. 10, 5690–5708.
  19. [19]E. M. Rains and N. J. A. Sloane, The shadow theory of modular and unimodular lattices, J. Number Theory 73 (1998), no. 2, 359–389.DOI
  20. [20]O. Regev and N. Stephens-Davidowitz, A reverse Minkowski theorem, Ann. Math. 199 (2024), no. 1, 1–49.

Paper details

vlnc:W_6r4zmfae
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

chatGPT

View statement
Looking for related papers…
Contents