Leveraging Binary Hashing for Scalable Index Assignment in Semantic Communications
Transmitting semantically structured embedding vectors over digital channels is costly in bit rate, while conven- tional vector quantization approaches face limitations in scalabil- ity, encoding complexity, and index assignment. This paper inves- tigates binary hashing techniques from the information retrieval literature as semantic indexing strategies for general-purpose networks. We study random Locality-Sensitive Hashing (LSH) along with Principal Component Analysis (PCA)-, Canonical Correlation Analysis (CCA)-, and ITQ (Iterative Quantization)- based variants in a semantic communication pipeline over a Binary Symmetric Channel. Embeddings are compressed into binary codes, reconstructed through Hamming retrieval from a shared table, and evaluated on downstream classification. Ex- periments on the Massive Text Embedding Benchmark (MTEB) and the Banking77 dataset show that data-dependent hashing improves upon random LSH, while ITQ refinement increases robustness to channel noise. Among the evaluated methods, CCA- ITQ achieves the best classification accuracy across the tested channel conditions. These results indicate that binary hashing is an efficient and scalable alternative to quantization-based embedding compression for semantic communications.
Authors
- Mohamad Assaad (ORCID: https://orcid.org/0000-0003-3909-6241)
- Louis-Adrien Dufréne (ORCID: https://orcid.org/0000-0002-8752-9841)
- Grégoire Lefebvre (ORCID: https://orcid.org/0000-0002-1325-3010)
- Quentin Lampin (ORCID: https://orcid.org/0000-0002-6996-9739)
- Leonardo Roque
- Kuangyun Zhu
Publication Details
- Journal
- arXiv (Cornell University)
- Published
- 2026-11-16
- DOI
- https://doi.org/10.48550/arxiv.2611.21260
- Primary Topic
- Advanced Data Compression Techniques
- Type
- preprint