Construction $\pi_A$ over Multiquadratic Fields for Compound Block-Fading Wiretap Channels

Conghui Li; Cong Ling; Juliana G. F. Souza

arxiv: 2604.12703 · v1 · submitted 2026-04-14 · 💻 cs.IT · math.IT

Construction π_A over Multiquadratic Fields for Compound Block-Fading Wiretap Channels

Juliana G. F. Souza , Conghui Li , Cong Ling This is my paper

Pith reviewed 2026-05-10 14:26 UTC · model grok-4.3

classification 💻 cs.IT math.IT

keywords lattice codeswiretap channelcompound channelblock-fadingmultiquadratic fieldsConstruction Astrong secrecymultistage decoding

0 comments

The pith

Multilevel lattice codes from multiquadratic fields achieve universal reliability and strong secrecy for compound block-fading wiretap channels.

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

The paper constructs multilevel lattice codes using multiquadratic number fields for secure communication over compound block-fading wiretap channels. It specializes Construction π_A over the ring of integers of these fields and exploits primes that split completely to decompose into small alphabets such as binary for multistage decoding. Combined with discrete Gaussian shaping and flatness-factor bounds, the codes deliver reliability to the legitimate receiver and strong secrecy uniformly across all possible eavesdropper channels in the compound set. A reader would care because many wireless wiretap scenarios involve unknown or varying fading that cannot be known in advance at the transmitter.

Core claim

We construct multilevel lattice codes from multiquadratic number fields for the compound block-fading wiretap channel. More precisely, we specialize Construction π_A over the ring of integers O_K and exploit rational primes that split completely in K to obtain a Chinese Remainder Theorem (CRT) decomposition into small residue alphabets, notably binary, which enables multistage decoding. The resulting nested lattices fit into the algebraic Construction A framework and, when combined with discrete Gaussian shaping and flatness-factor bounds, provide universal reliability for the legitimate receiver and strong secrecy uniformly over the eavesdropper compound set.

What carries the argument

The algebraic Construction π_A specialized over the ring of integers of multiquadratic fields, using CRT decomposition into small alphabets for multistage decoding.

Load-bearing premise

The flatness-factor bounds for discrete Gaussian distributions continue to hold uniformly over the compound block-fading channel set and the CRT decomposition preserves the required nesting and secrecy properties.

What would settle it

A specific channel realization in the compound set where the flatness factor exceeds the bound, causing either a decoding error at the legitimate receiver or measurable information leakage to the eavesdropper.

Figures

Figures reproduced from arXiv: 2604.12703 by Conghui Li, Cong Ling, Juliana G. F. Souza.

read the original abstract

We construct multilevel lattice codes from multiquadratic number fields for the compound block-fading wiretap channel. More precisely, we specialize Construction $\pi_A$ over the ring of integers $\mathcal{O}_K$ and exploit rational primes that split completely in $K$ to obtain a Chinese Remainder Theorem (CRT) decomposition into small residue alphabets, notably binary, which enables multistage decoding. The resulting nested lattices fit into the algebraic Construction A framework and, when combined with discrete Gaussian shaping and flatness-factor bounds, provide universal reliability for the legitimate receiver and strong secrecy uniformly over the eavesdropper compound set.

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.

Desk Editor's Note private letter to a colleague

The paper specializes Construction π_A to multiquadratic fields for binary CRT decomposition and multistage decoding in compound wiretap channels, but the flatness bounds under arbitrary fading need explicit worst-case verification.

read the letter

The main thing to know is that this work takes the algebraic Construction π_A and narrows it to multiquadratic fields where rational primes split completely. That choice yields a CRT decomposition into binary residue alphabets, which supports multistage decoding for the compound block-fading wiretap channel. The authors then wrap the resulting nested lattices with discrete Gaussian shaping and flatness-factor arguments to target universal reliability on the main link and strong secrecy across the eavesdropper compound set. That specialization is the concrete new piece not already in the cited prior art. The setup fits the standard Construction A framework cleanly, and the field choice is a reasonable engineering move to keep the alphabets small and decoding tractable. The abstract and construction outline are straightforward enough that a reader familiar with lattice coding for physical-layer security can follow the plan. The soft spot sits in the uniformity claim. Flatness-factor bounds are typically derived for fixed lattices and fixed channels; here the compound fading multiplies the lattice by different scalars per block, and the CRT step further splits the structure into component codes. It is not immediate that the smoothing parameter stays small enough relative to the minimum distance in every case inside the compound class, so the divergence bound used for secrecy could loosen in the worst case. The paper would be stronger with an explicit supremum argument or adjusted parameter that covers the entire compound set. This is aimed at the small group of people working on algebraic number-theoretic tools for wiretap coding in fading. A reader already following Construction A or multilevel lattices in security contexts would pick up the specific field and decoding details. It deserves peer review because the core construction is grounded in reproducible algebraic facts and addresses a relevant channel model, even if the bound transfer needs tightening in revision.

Referee Report

2 major / 1 minor

Summary. The manuscript constructs multilevel lattice codes from multiquadratic number fields by specializing Construction π_A over the ring of integers O_K. It exploits rational primes that split completely to obtain a CRT decomposition into small (notably binary) residue alphabets supporting multistage decoding. The resulting nested lattices, when equipped with discrete Gaussian shaping and flatness-factor bounds, are claimed to achieve universal reliability for the legitimate receiver and strong secrecy uniformly over the eavesdropper compound block-fading channel set.

Significance. If the uniformity claims are established, the work would supply an algebraic framework for explicit, multistage-decodable lattice codes in compound wiretap settings, extending Construction A techniques to fading channels via number-theoretic decompositions. The CRT reduction to binary alphabets and the use of multiquadratic fields constitute concrete strengths that could support practical implementations once the bounds are verified.

major comments (2)

Abstract: the claim that discrete-Gaussian-shaped nested lattices deliver strong secrecy uniformly over the compound set rests on flatness-factor bounds remaining controlled after block-fading multiplication and after the CRT decomposition. No explicit supremum or worst-case analysis over the arbitrary (bounded-away-from-zero) fading coefficients is supplied, so it is unclear whether the smoothing parameter stays below the minimum distance in every component code.
Abstract: the abstract asserts that the lattices plus Gaussian shaping and flatness bounds deliver the claimed guarantees, yet provides no derivation steps, error analysis, or explicit bound statements. The central reliability and secrecy claims therefore rest on unshown technical details that must be supplied and verified in the main text.

minor comments (1)

Abstract: the notation for the compound set and the precise definition of 'universal reliability' could be stated more explicitly to aid readers unfamiliar with the algebraic lattice literature.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the thorough review and insightful comments on our manuscript arXiv:2604.12703. The concerns raised about the abstract claims and supporting analysis are well-taken. We address each major comment below and outline the revisions we will make to strengthen the presentation of the flatness-factor bounds and technical derivations.

read point-by-point responses

Referee: Abstract: the claim that discrete-Gaussian-shaped nested lattices deliver strong secrecy uniformly over the compound set rests on flatness-factor bounds remaining controlled after block-fading multiplication and after the CRT decomposition. No explicit supremum or worst-case analysis over the arbitrary (bounded-away-from-zero) fading coefficients is supplied, so it is unclear whether the smoothing parameter stays below the minimum distance in every component code.

Authors: We agree that an explicit uniform bound is essential for the compound-channel claim. In the revised manuscript we will add a new proposition (placed after the CRT decomposition in Section III) that derives a worst-case supremum on the flatness factor over all admissible fading vectors. The argument proceeds by bounding the product of the fading coefficients away from zero, showing that the effective smoothing parameter remains strictly below the minimum distance of each binary residue code. This establishes the required control after both the block-fading multiplication and the CRT step. revision: yes
Referee: Abstract: the abstract asserts that the lattices plus Gaussian shaping and flatness bounds deliver the claimed guarantees, yet provides no derivation steps, error analysis, or explicit bound statements. The central reliability and secrecy claims therefore rest on unshown technical details that must be supplied and verified in the main text.

Authors: The full derivations appear in Sections IV and V (reliability via union bound on the legitimate channel and secrecy via the flatness-factor criterion for the compound eavesdropper set). To make this transparent, we will (i) expand the abstract by one sentence that explicitly references the key theorems, (ii) add a short error-probability derivation summary at the beginning of Section IV, and (iii) include the explicit flatness-factor bound statements that were previously only sketched. These additions will allow the reader to trace the claims without ambiguity. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation invokes independent algebraic facts and prior bounds

full rationale

The paper specializes Construction π_A over O_K for multiquadratic fields, applies CRT decomposition to obtain binary alphabets, and invokes discrete-Gaussian shaping together with existing flatness-factor bounds to obtain reliability and secrecy. No equation or step in the abstract or described chain redefines a quantity in terms of itself, renames a fitted parameter as a prediction, or reduces the central claim to a self-citation whose content is unverified within the paper. The cited flatness results and algebraic number theory facts are treated as external inputs whose validity is independent of the present construction, satisfying the criteria for non-circular support.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on standard facts from algebraic number theory and lattice coding; no free parameters or new entities are introduced in the abstract.

axioms (2)

domain assumption Rational primes split completely in the multiquadratic field K
Invoked to obtain the CRT decomposition into small residue alphabets enabling multistage decoding.
domain assumption Flatness-factor bounds hold for the discrete Gaussian shaping over the compound channel
Used to guarantee universal reliability and strong secrecy.

pith-pipeline@v0.9.0 · 5404 in / 1367 out tokens · 30980 ms · 2026-05-10T14:26:15.994139+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

1 extracted references · 1 canonical work pages

[1]

[BL13] M. R. Bloch and J. N. Laneman. Strong secrecy from chan- nel resolvability.IEEE Transactions on Information Theory, 59(12):8077–8098, 2013. [Cam18] A. Campello. Random ensembles of lattices from general- ized reductions.IEEE Transactions on Information Theory, 64(7):5231–5239, 2018. [CL20] Antonio Campello and Cong Ling. Random algebraic lattices a...

work page 2013

[1] [1]

[BL13] M. R. Bloch and J. N. Laneman. Strong secrecy from chan- nel resolvability.IEEE Transactions on Information Theory, 59(12):8077–8098, 2013. [Cam18] A. Campello. Random ensembles of lattices from general- ized reductions.IEEE Transactions on Information Theory, 64(7):5231–5239, 2018. [CL20] Antonio Campello and Cong Ling. Random algebraic lattices a...

work page 2013