信息论
Guessing Random Additive Noise Decoding (GRAND) performs decoding by sequentially guessing channel error patterns (EPs). Ordered Reliability Bits GRAND (ORBGRAND) is a notable instance suitable for efficient implementation, as it schedules…
We consider the transmission of the outputs of counting queries over a binary symmetric channel (BSC), where Hamming codes are employed as the channel encoder. Since the channel is inherently noisy, this transmission already provides a…
Bent partitions play a significant role in constructing bent functions and have rich connections with coding theory and combinatorics. In this paper, we introduce $s$-plateaued partitions, which generalize the bent partitions. Let…
Approximate message passing (AMP) provides fast iterative algorithms for high-dimensional signal recovery with Gaussian design matrices, while the Convex Gaussian Min-max Theorem (CGMT) gives a static optimization framework for obtaining…
The method of types is a fundamental tool in classical information theory, with applications ranging from composite hypothesis testing and universal source coding to the capacity of arbitrarily varying channels. In this work we introduce an…
Comparing two probability distributions is a basic building block of statistics and machine learning, and the right family is well understood: the R\'enyi divergences of order $\alpha\in[0,\infty]$ are the unique family monotone under data…
Erasure codes are a core component of most existing large-scale distributed storage systems, ensuring reliability against node failures. Recent work has shown that adapting code parameters to changing node failure rates can lead to…
We study the Threshold Group Testing (TGT) problem without a gap in the noiseless, non-adaptive setting, where the goal is to exactly recover a sparse binary vector from pooled test outcomes using as few tests as possible. In TGT, a test…
We study both the deterministic and randomised variants of noise-guessing decoding in additive memoryless channels. The error and complexity exponents of such decoding schemes are analysed under mismatched decoding metrics, and then…
The radius-one limited permutation channel $\operatorname{LPC}_{\infty}(1)$ maps a transmitted word to any word obtained by an arbitrary set of pairwise disjoint adjacent transpositions. This is the $r=1$ case of the $\ell_\infty$-limited…
With the explosive growth of network scale and data volume, wireless communication is facing an increasingly severe limitation of spectrum resources. Semantic communication has emerged as a promising paradigm to break the bandwidth…
We solve the open problem of constructing a Bayes-optimal iterative signal recovery algorithm for linear-Gaussian \emph{multiuser} communication systems with random precoding at the transmitters. Specifically, we consider the received…
We introduce and analyze several grouped variants of the method of reverse importance sampling (RIS) for estimating a partition function from samples of the Boltzmann distribution $p(x)=e^{ \betaU(x)}/Z(\beta)$. Ordinary RIS weighs each…
Erasure codes are a key technique for achieving fault-tolerant storage in modern distributed storage systems. As storage systems evolve, their code parameters often need to be adjusted to accommodate changes in storage scale, reliability…
Pinching-antenna (PA) systems have been widely investigated as a flexible architecture for waveguide-enabled wireless transmission. Existing analytical models, however, often rely on isotropic radiation assumptions and simplified…
Non-coherent Grassmannian (unitary space-time) signaling detects on the received subspace, which is invariant to a branch-side (polarization or mode-coupling) rotation and to a phase that is constant over the coherence block. It therefore…
This paper studies deletion-correcting codes for the $\ell$-symbol read channel, whose noiseless output is the vector of all consecutive $\ell$-mers of a transmitted sequence. This model is motivated by overlapping-read mechanisms arising…
We establish two structural majorization relations, which we call precursors, underlying the properties of supermodularity and subadditivity on the lattice induced by majorization. These are precursors in that they immediately imply that…
We prove a list recovery guarantee for random low-rate linear codes over sufficiently large prime fields. For fixed dimension $d$, error fraction $\alpha$, and accuracy parameter $\varepsilon$, a random $d$-dimensional linear code $C…
Superimposed pilot (SIP) transmission improves spectral efficiency by eliminating the dedicated pilot overhead required in orthogonal pilot (OP)-based schemes. However, SIP suffers from severe pilot-data coupling, which leads to a critical…