NewEvery arXiv paper, its researchers & institutions — mapped.
the archive

cs.IT

40.2k results
cs.IT2026

Data-Driven Batteryless Channel Sounding for Wi-Fi 8-Inspired Downlink MU-MIMO

Muhan Zhang, Chuqi Zhang, Qitong Xu +4

cs.IT2026

On The Most Discriminative Boolean Functions for Correlated Sources

Jun Chen, Shun Watanabe, Lei Yu

The paper investigates which pairs of Boolean functions best separate two correlated binary sources by maximizing Kullback-Leibler divergence (and Fisher information), proving that…

#boolean functions#correlated sources#kl divergence#fisher information
cs.IT2026

Low-Pathwidth GRAND: Exact Likelihood-Ordered Enumeration for BPSK Transmission over Correlated Gaussian Noise

Behrooz Razeghi

The paper introduces Low-Pathwidth GRAND (LP‑GRAND), an exact maximum‑likelihood decoding method for BPSK transmission over correlated Gaussian noise that exploits the low pathwidt…

#maximum likelihood decoding#GRAND algorithm#correlated Gaussian noise#pathwidth
cs.IT2026

Counterexamples to Charpin's Conjecture on BCH codes

Run Zheng, Yaoran Yang, Yutong Zhang +1

cs.IT2026

Constructing linear codes from digraphs and groups

Coen del Valle, Cheryl E. Praeger

The paper extends the Cayley code construction by introducing graph and digraph codes, analyzes their algebraic and combinatorial properties, and shows they can yield good LDPC cod…

#linear codes#ldpc codes#graph codes#digraph codes
cs.IT2026

Generalized Query-Oriented Image Semantic Coding Empowered by Large AI Models and Semantic-Aware Hybrid Beamforming

Sin-Yu Huang, Vincent W. S. Wong

The paper introduces a query-oriented image semantic coding framework that uses a pretrained large AI model to extract user‑relevant features and a semantic‑aware hybrid beamformin…

#semantic communication#query-oriented coding#image transmission#large-scale MIMO-OFDM
cs.IT2026

The Capacity of a Family of Sticky Channels

Mladen Kovačević

The paper exactly determines the Shannon and zero‑error capacity of a family of q‑ary sticky‑insertion (repeat) channels, showing it equals log₂ λ bits per symbol under specific re…

#channel capacity#sticky channels#repeat channels#zero-error capacity
cs.IT2026

Forecasting Land Art Under Climate Scenarios

Alev Cinbarci, Sean Kalaycioglu

The paper builds a two‑stage pipeline to forecast visual complexity of the Spiral Jetty land artwork under future climate scenarios, using climate model outputs, statistical regres…

#climate change#land art#satellite imagery#image forecasting
cs.IT2026

Green Cell-Free Massive MIMO for ISAC: Joint Cloud, Fronthaul and Radio Resource Allocation

Zinat Behdad, Özlem Tuğfe Demir, Ki Won Sung +2

The paper proposes a cross‑layer framework that jointly optimizes transmit power, AP operation, user‑sensing association, and cloud/fronthaul resources in cell‑free massive MIMO sy…

#cell-free massive mimo#integrated sensing and communication#resource allocation#green communications
cs.IT2026

Polynomially Improved Lower Bounds for Trifferent Codes via Locally Sparse $3$-Uniform Hypergraphs

Xuejiao Han, Yubo Sun, Gennian Ge

The paper improves the known lower bound on the size of ternary trifferent codes by a factor of √n, using a refined concatenation method that employs locally sparse 3‑uniform hyper…

#trifferent codes#ternary codes#hypergraph theory#lower bounds
cs.IT2026

Upper bounds on the length of quasi-MDS codes

Umberto Martínez-Peñas, Rubén Rodríguez-Ballesteros

The paper derives new upper bounds on the length of linear quasi‑MDS (QMDS) codes over finite fields by linking the problem to subspace packing and partial spread constructions fro…

#quasi-mds codes#length bounds#subspace packings#partial spreads
cs.IT2026

Self-dual double cyclic codes over $\mathbb{F}_q$

Ricky Aditya, Aleams Barra, Djoko Suprijanto

The paper studies self‑dual double cyclic codes over finite fields, giving conditions for their existence and construction methods for various code lengths.

#self-dual codes#double cyclic codes#finite fields#code construction
cs.IT2026

Entanglement-Assisted Quantum Locally Recoverable Codes: Characterizations, Bounds, and Constructions

Yang Li, San Ling, Zhenliang Lu +2

The paper proposes entanglement-assisted quantum locally recoverable codes (EAQLRCs) that relax dual‑containing constraints of standard constructions, provides locality and Singlet…

#quantum error correction#locally recoverable codes#entanglement assistance#CSS-like constructions
cs.IT2026

The Capacity Region of the Broadcast Channel with Non-Signaling Assistance

Yuhang Yao, Syed A. Jafar

The paper determines the exact set of achievable communication rates for a K‑user discrete memoryless broadcast channel when the transmitter and all receivers can use non‑signaling…

#broadcast channel#non-signaling assistance#capacity region#discrete memoryless channels
cs.IT2026

Universal Individual-Sequence Prediction with a Primitive-Recursive Superpredictor

Amir Leshem

cs.IT2026

Learned Blockwise Port Activation for Real Time Beamforming in Fluid Antenna Arrays

Yuanhui Wu, Zhentian Zhang, Hanjiang Hong +5

cs.IT2026

The Rate-Distortion-Deception Tradeoff

Semih Akkoc, Sahan Liyanaarachchi, Sennur Ulukus +1

cs.IT2026

Bayesian-Guided Cooperative RL Beamforming for Wireless Adversarial User Detection

Parmida Geranmayeh, Onur Günlü

The paper introduces a reinforcement learning framework using Q-learning and SARSA to adaptively select beamforming directions and detect adversarial users in wireless networks, ac…

#beamforming#reinforcement learning#adversarial detection#wireless security
cs.IT2026

System-Aware Adaptive CSI Feedback via RL-Guided Autoencoder Switching in Multi-User MIMO System

Maryam Ansarifard, Mohit K. Sharma, George Exarchakos +1

The paper introduces a reinforcement‑learning controller that selects among multiple pretrained autoencoders with different compression ratios to adaptively compress CSI feedback i…

#mimo#csi feedback#reinforcement learning#autoencoder
cs.IT2026

The Code Distortion Problem

Huck Bennett, Matthew Fox, Bryant Morrell

The paper defines a code distortion measure between linear error‑correcting codes and studies the computational problem of finding a minimum‑distortion mapping, proving NP‑hardness…

#coding theory#code equivalence#distortion measures#approximation algorithms
cs.IT2026

Secrecy Energy Efficiency for IRS-Assisted Low-Altitude Communications: A D3QN-PER Based Approach

Ya Gao, Peina Zhao, Yiheng Li +1

cs.IT2026

Minimum enclosing Bregman balls made easy

Frank Nielsen

cs.IT2026

Cyclic codes and cyclically covering subspaces

Xuan Wang, Minjia Shi

cs.IT2026

The automorphism groups of random linear codes

Xiaoru Li, Qi Wang, Yue Zhou