信息论
The rapid advancements in foundation models and sixth-generation (6G) wireless communication systems necessitate the development of efficient, scalable, and privacy-preserving machine learning approaches. For foundation models in 6G, split…
Self-supervised learning has achieved remarkable empirical success in learning robust representations without explicit labels, most recently demonstrated within the framework of Joint-Embedding Predictive Architectures (JEPA). However, a…
Motivated by a continuous-time formulation of the Blahut-Arimoto scheme, we study a nonlinear dissipative flow on the probability simplex generated by a Gibbs-type self-consistent evolution. We establish an exact dissipation identity…
In relative entropy coding, a sender aims to design a stochastic code such that, on input $X \sim P_X$, the receiver can generate a sample $Y \sim P_{Y \mid X}$. It is a standard result that (1) this requires at least $I(X; Y)$ bits, (2)…
We consider subset recovery in the many-access Gaussian multiple-access channel with a shared spherical codebook, where codewords are drawn independently and uniformly from the hypersphere of radius \( \sqrt{nP} \), the number of active…
We study the source-side single-letter $d$-tilted sum for a stationary binary Markov chain under Hamming distortion, induced by the single-letter Blahut--Arimoto operating point computed from the stationary marginal $\pi$. We show that this…
In this paper, we study rate-distortion theory for general sources with an emphasis on the existence of optimal reconstruction distributions on noncompact alphabets. Classical attainability results typically rely on compactness of the…
Within the family of guessing-based decoding algorithms, ordered reliability bits GRAND (ORBGRAND) has attracted considerable attention due to its efficient use of soft information and suitability for hardware implementation. It has also…
While mutual information effectively quantifies dependence between two variables, it does not by itself reveal the complex, fine-grained interactions among variables, i.e., how multiple sources contribute redundantly, uniquely, or…
In this paper, we study column twisted Reed-Solomon(TRS) codes. We establish some sufficient conditions for these codes to be MDS and show that the dimension of their Schur square codes is $2k$. Consequently, these TRS codes are shown to be…
While significant research efforts have been directed toward developing more capable neural decoding architectures, comparatively little attention has been paid to the quality of training data. In this study, we address the challenge of…
Mutual information between two random variables is a well-studied notion, whose understanding is fairly complete. Mutual information between one random variable and a pair of other random variables, however, is a far more involved notion.…
Communications in highly dynamic channels relying on training-based channel estimation experience a trade-off between increasing channel measurement accuracy by sending more frequent training sequences and increasing data rate by sending…
Discrete entropy estimation is a classic information theory problem, wherein the average information content of a discrete random variable is estimated from samples alone. Naive approaches, such as the plugin method, fail to account for the…
Range coders and ANS replace empirical probabilities with integer frequencies summing to a fixed $M$; the resulting per-symbol code-length redundancy is exactly the KL divergence of the empirical distribution from the quantized one.…
Learning-based MIMO detection has shown strong empirical performance, yet existing methods typically rely on fixed-depth architectures without explicitly modeling the progressive refinement of symbol estimates. In this paper, we revisit…
Maximum distance separable (MDS) array codes constitute an important class of error-correcting codes due to their optimal distance properties and their relevance in distributed storage systems. In this paper, we investigate the construction…
This paper pioneers a novel scheme for artificial-noise (AN)-aided movable-antenna (MA)-enabled physical-layer service integration (PLSI) to harmonize the simultaneous delivery of multicast and confidential messages. By jointly exploiting…
In this paper, we consider remote reconstruction over wireless networks when simultaneous accuracy at the legitimate receiver and confidentiality against eavesdropping are required. These two objectives are often treated separately, even…
Sparsity in the delay-Doppler (DD) domain enables efficient channel estimation, but the realization-wise sparsity level is rarely known in advance, and it fluctuates. What if we could estimate the channel without ever knowing how many…