信息论
Rank-metric codes are subspaces of matrices over finite fields endowed with the rank metric and admit a natural tensorial representation. The tensor rank provides a measure of the minimal size of a decomposition of a code into rank-one…
Block codes are considered for improving the reliability of messages stored in a computer memory with both stuck-at defects and random errors. It is assumed that the side information about the state of the defects is available to the…
We investigate weakly constrained codes, in which specific patterns occur with prescribed frequencies rather than being strictly forbidden as in conventional constrained coding. We propose a capacity-achieving construction of a weakly…
In this paper, we propose a framework of source encryption, where cryptographic processing is applied to a prescribed fixed length source code. The proposed source encryption framework is based on the secure communication framework of the…
We study the problem of locating violating principal minors in matrix families lying near the boundary of P-matrices. Rather than viewing this search problem purely through computational complexity, we analyze it from an…
In this work, we investigate a blockage-aware pinching antenna (PA) system designed for secure and robust wireless communication. The considered system comprises a base station equipped with multiple waveguides, each hosting multiple PAs,…
Polar codes are the first codes with a proven capacity-achieving capability, but their decoding faces several challenges, especially under long code lengths. In this paper, we target algorithmic improvements and analyses to enable the…
Semi-blind joint channel estimation and data detection (JCD) is a promising approach to mitigate pilot contamination in cell-free massive multiple-input multiple-output (CF-MaMIMO) networks. The effectiveness of such methods fundamentally…
We present a new family of information-theoretic generalization bounds within the framework of conditional mutual information (CMI). Most of our results are established based on the leave-$m$-out (L$m$O) cross-validation error, with $m$…
There is a surge of need for fresh information with the overwhelming proliferation of the Internet of Things (IoT) applications. To characterize the information freshness perceived by the destination, the age of information (AoI) has been…
Compression based on asymmetric numeral systems (ANS) combines high encoding and decoding speeds with a compression ratio close to Shannon entropy, while forward modeling of the information source makes it possible to obtain an estimated…
Flexible coupler antenna systems have recently received significant research interest due to their capability to intelligently reconfigure wireless channels by controlling coupler positions and/or rotations and dynamically exploiting mutual…
The conventional linear scaling of beamforming gain with the number of antennas is not a fundamental physical limitation, but rather a consequence of the half-wavelength spacings that minimize mutual coupling. Relaxing this constraint…
Near-field electromagnetic focusing is central to 6G communication, sensing, and integrated sensing and communication (ISAC) systems. However, for a fixed aperture, the resolution-constrained usable range of conventional single-layer…
In this paper, a low-complexity approach for the automorphism ensemble decoder (AED) using successive cancellation (SC) as constituent decoders is proposed. The approach sequentially activates sub-decoders and terminates the decoding…
Classical energy detection (ED) methods for cognitive radio (CR) have addressed noise uncertainty as deviations in noise power and signal uncertainty as variability in signal characteristics, which use probabilistic methods and assume fixed…
Zero-error recovery under deterministic partial views is graph recovery for the induced confusability relation. A finite family of coordinate-subset observations determines a graph on latent states; $T$-ary exact recovery is graph…
In collaborative inference (CI), transmitting intermediate representations $Z$ from edge devices enables model inversion attacks (MIA) that reconstruct the original inputs $X$, while existing defenses mainly perturb shallow-layer $Z$ at the…
A fundamental question in information theory is to quantify the loss of information under a noisy channel. Partial orders and contraction coefficients are typical tools to that end, however, they are often also challenging to evaluate. For…
This work investigates a privacy metric based on Chernoff information motivated by its importance in characterizing the optimal classifier's performance. Adversarial classification centers on minimizing the probability of error when…