Fluid Antenna Secure Channel-driven Constellation (FASCC): a Physical Layer Security approach

Daniel Dinis; Risto Wichman

Home/Archive/arXiv

arXiv · 2610.04625

Fluid Antenna Secure Channel-driven Constellation (FASCC): a Physical Layer Security approach

Daniel Dinis·Risto Wichman

View original source ↗Read source document ↗Export metadata ↓

Abstract

Fluid antenna systems (FAS) have recently emerged as a promising technology for future wireless networks due to their ability to access a large number of channel realizations using a single radio-frequency chain. This capability creates new opportunities for physical-layer security beyond conventional beamforming and artificial-noise approaches. In this paper, we propose a novel Fluid Antenna Secure Channel-driven Constellation (FASCC) framework for downlink communications, in which information is conveyed through channel-domain constellation points generated by FAS port selection and phase adaptation. Two complementary FASCC schemes are developed, depending on the availability of eavesdropper's channel state information. Numerical results demonstrate that the proposed FASCC framework achieves significant secrecy gains in terms of bit error rate and mutual-information secrecy performance, even when Eve is significantly closer to the base station than Bob.

Explore related subjects

cs.IT math.IT

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Daniel Dinis, Risto Wichman. 2026-10-03. Fluid Antenna Secure Channel-driven Constellation (FASCC): a Physical Layer Security approach. https://arxiv.org/abs/2610.04625

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

LEO-based Carrier-Phase Positioning for 6G: Design Insights and Comparison with GNSS

The integration of non-terrestrial networks (NTN) into 5G new radio (NR) enables a new class of positioning capabilities based on cellular signals transmitted by Low-Earth Orbit (LEO) satellites. In this paper, we investigate joint delay-and-carrier-phase positioning for LEO-based NR-NTN systems and provide a convergence-centric comparison with Global Navigation Satellite Systems (GNSS). We show that the rapid orbital motion of LEO satellites induces strong temporal and geometric diversity across observation epochs, thereby improving the conditioning of multi-epoch carrier-phase models and enabling significantly faster integer-ambiguity convergence. To enable robust carrier-phase tracking under intermittent positioning reference signal (PRS) transmissions, we propose a dual-waveform design that combines wideband PRS for delay estimation with a continuous narrowband carrier for phase tracking. Using a realistic simulation framework incorporating LEO orbit dynamics, we demonstrate that LEO-based joint delay-and-carrier-phase positioning achieves cm-level accuracy with convergence times on the order of a few seconds, whereas GNSS remains limited to meter-level accuracy over comparable short observation windows. These results establish LEO-based cellular positioning as a strong complement and potential alternative to GNSS for high-accuracy positioning, navigation, and timing (PNT) services in future wireless networks.

cs.IT↗

arXiv2026

Empirical coordination in the finite blocklength regime: an achievability result---Extended version

Empirical coordination offers a way to understand how agents can coordinate actions under communication constraints. This paper investigates the finite blocklength regime of this problem, where the encoder and decoder aim to produce a sequence of action pairs that is jointly typical with respect to a target distribution. Adopting Shannon's random coding argument and leveraging the method of types, we analyze the average performance of a random codebook to establish an achievability result. The resulting bound on the optimal rate is presented both in exact form and as an asymptotic expansion, aligning with the prevailing characterizations in the finite blocklength literature. This work extends finite blocklength analysis to the empirical coordination setting, complementing existing results on strong coordination.

cs.IT↗

arXiv2026

Generalized Rank Weight and Extended Generalized Poset Weight Defined For Codes Over Rings: A Galois Connection Approach

In this paper, we study generalized rank weights (GRWs) and extended generalized poset weight (EGPWs) of codes over rings via a Galois connection approach. First, we show that various coding-theoretic properties related to generalized weights, including security drops of a code employed in wire-tap channel of type II, connections between generalized weights of a Gabidulin code and its associated Delsarte code, (generalized) Singleton bound, MDS discrepancy of a code, characterizations of MDS, near MDS, $i$-MDS, MRD, near MRD, $i$-MRD, (dually) quasi-MRD codes as well as evasive property of subspaces, can be reformulated in terms of Galois connections. Next, we study GRWs and rank profiles defined for modules over principal ideal rings, especially those over chain rings. Generalizing GRWs defined for vector spaces over fields, we establish a singleton bound and a Wei-type duality theorem, characterize MRD, near MRD and dually quasi-MRD codes and determine their GRWs; moreover, we characterize $i$-MRD codes and establish a scattered bound for $(h,h)$-evasive codes over chain rings, generalizing counterpart result established for vector space over finite fields. Finally, we propose and study EGPWs and extended poset profiles defined for modules with a composition series, which in fact form a Galois connection. Generalizing EGPWs defined for modules over finite Galois rings, we establish a Wei-type duality theorem for modules over arbitrary quasi-Frobenius rings, which unifies the two Wei-type duality theorems derived in both \cite{32} and \cite{33}.

cs.IT↗