Paperlane

no. 16 · Tuesday 17 November 2026

Recursive Spectral Graph Partitioning Coding for Index Assignment in Semantic Communications

Leonardo Roque, Louis-Adrien Dufrène, Quentin Lampin, Grégoire Lefebvre and Mohamad Assaad

math.IT

Abstract

Transmitting quantized semantic embeddings over a bit-flip channel requires a binary mapping that minimizes expected reconstruction distortion. The classical Binary Switching Algorithm (BSA) ($\mathcal{O}(K^3 \log K)$ for $K$ centroids) yields locally optimal assignments but ignores hierarchical bit significance, making it incompatible with Unequal Error Protection (UEP). We propose Recursive Spectral Graph Partitioning (RSGP), which recursively bisects the centroid affinity graph along the Fiedler eigenvector so that early bits separate semantically distant groups while later bits refine local structure. RSGP runs in $\mathcal{O}(K^3)$ with no iterative outer loop, and is the only method studied to show a systematic positive UEP gain: protecting early bits over later ones improves accuracy for RSGP, while being neutral or harmful for unstructured assignments. Experiments on the Banking77 dataset and the Massive Text Embedding Benchmark (MTEB) confirm that RSGP consistently matches or exceeds BSA accuracy across codebook sizes and error profiles.

fields
Information Theory
pdf ↗ page arXiv:2611.21238 ↗