信息论
In the All-Reduce problem, each one of the K nodes holds an input and wishes to compute the sum of all K inputs through a communication network where each pair of nodes is connected by a parallel link with arbitrary bandwidth. The…
The discrete time queueing system is highly applicable to modern telecommunication systems, where it provides adaptive packet handling, congestion controlled security/inspection, energy efficient operation, and supports bursty traffic…
Realizing the 6G vision of artificial intelligence (AI) and integrated sensing and communication (ISAC) critically requires large-scale real-world channel datasets for channel modeling and data-driven AI models. However, traditional…
We study the impact of imperfect line-of-sight (LoS) phase tracking on the uplink performance of cell-free massive MIMO networks. Unlike prior works that assume perfectly known or completely unknown phases, we consider a realistic regime…
Uplink coverage in cellular networks is constrained by the maximum UE transmit power, making peak-to-average power ratio (PAPR) reduction essential. While DFT-s-OFDM with frequency-domain spectral shaping (FDSS) achieves significantly lower…
We give a recursive decoding algorithm for projective Reed-Muller codes making use of a decoder for affine Reed-Muller codes. We determine the number of errors that can be corrected in this way, which is the current highest for decoders of…
We study the rate-distortion problem for both scalar and vector memoryless heavy-tailed $\alpha$-stable sources ($0 < \alpha < 2$). Using a recently defined notion of ``strength" as a power measure, we derive the rate-distortion function…
In the modern era of large-scale computing systems, a crucial use of error correcting codes is to judiciously introduce redundancy to ensure recoverability from failure. To get the most out of every byte, practitioners and theorists have…
This paper investigates single-error-correcting function-correcting codes (SEFCCs) for the Hamming code membership function (HCMF), which indicates whether a vector in $\mathbb{F}_2^7$ belongs to the [7,4,3]-Hamming code. Necessary and…
The sixth generation (6G) network is expected to deploy larger multiple-input multiple-output (MIMO) arrays to support massive connectivity, which will increase overhead and latency at the physical layer. Meanwhile, emerging 6G demands such…
We investigate permutation polynomials F over finite fields F_{p^n} whose generalized derivative maps x -> F(x + a) - cF(x) are themselves permutations for all nonzero shifts a. This property, termed perfect c-nonlinearity (PcN), represents…
Sum-rank codes have wide applications in multishot network coding, distributed storage and the construction of space-time codes. Asymptotically good sequences of linearized algebraic geometry sum-rank codes, exceeding the…
Terahertz (THz) communications has emerged as a promising technology for future wireless systems due to its potential to support extremely high data rates. However, severe path loss, blockage effects, and sensitivity to beam misalignment…
Guided wireless technology is an innovative approach that combines the strengths of guided waves and wireless communication. In traditional wireless systems, signals propagate through the air, where they are vulnerable to interference,…
In this paper, we present new constructions of $q$-ary Singleton-optimal locally repairable codes (LRCs) with minimum distance $d=6$ and locality $r=3$, based on combinatorial structures from finite geometry. By exploiting the well-known…
This paper provides a fundamental characterization of the discrete ambiguity functions (AFs) of random communication waveforms under arbitrary orthonormal modulation with random constellation symbols, which serve as a key metric for…
Combinatorial group testing reduces screening costs and turnaround time but remains challenging to apply due to design complexity, varying applicability, and lack of implementation tools. Here we present PoolPy, a unified end-to-end…
Hoeffding's formulation and solution to the universal hypothesis testing (UHT) problem had a profound impact on many subsequent works dealing with asymmetric hypotheses. In this work, we introduce a quantum universal hypothesis testing…
In 1948, Shannon used a probabilistic argument to show the existence of codes achieving a maximal rate defined by the channel capacity. In 1954, Muller and Reed introduced a simple deterministic code construction based on polynomial…
Terrestrial free-space optical (FSO) communication systems, while designed to operate on large unlicensed optical bandwidths, are fundamentally power-constrained due to stringent eye-safety regulations. Moreover, channel fluctuations…