信息论
Analog error correction codes have been proposed for analog in-memory computing on resistive crossbars, which can accelerate vector-matrix multiplication for machine learning. Unlike traditional communication or storage channels, this…
In this paper, we construct several infinite families of $q$-ary constacyclic codes over a finite field $\mathbb{F}_q$ with length $n$, dimension around $n/2$, and minimum distance at least $cn/\log_q n$ for some positive constant $c$. They…
In this paper, we propose several constructions of Locally Recoverable Codes from elliptic surfaces. In particular, we are able to obtain codes with availability $t>2$, codes with hierarchical locality and, finally, codes which combine…
Integrated sensing and communication (ISAC) is a promising feature of future communication networks. While spatial sensing can improve network performance and enable external services, it also creates privacy challenges that go beyond the…
This paper proposes a novel fluid antenna system (FAS)-enabled architecture to improve energy efficiency (EE) without sacrificing capacity. Specifically, we integrate FAS into cell-free massive MIMO systems to counteract low-resolution…
This paper investigates uplink multiple access for the coexistence of enhanced mobile broadband+ (eMBB+) and massive machine-type communications+ (mMTC+) in terminal-centric cell-free massive MIMO (CF-mMIMO) systems. We propose a…
We prove that Sharma-Mittal entropy is a subadditive and supermodular function on the lattice of all $n$-dimensional probability distributions, ordered according to the partial order relation defined by majorization among vectors. Our…
This paper gives a unified algebraic solution to seven open problems of Wang, Tang and Ding on cyclic, negacyclic and constacyclic codes supporting designs. For the cyclic code \[ C\left(\frac{p^s-1}{2},\frac{p^s+1}{2}\right), \] a Cayley…
Recently, minimal linear codes have been extensively studied due to their applications in secret sharing schemes, secure two-party computations, and so on. Constructing minimal linear codes violating the Ashikhmin-Barg condition and then…
In modern data storage systems, non-binary LDPC codes for recovering from disk failures are increasingly considered strong competitors to MDS codes such as Reed-Solomon codes. Since disk failures can be modeled as erasures, we analyze…
In this paper, we describe linear and cyclic codes over the rings of the form $R_{s,p}=\mathbb{Z}_{p}[u]/\left( f\left(u\right) /\left( u-s\right) \right)$, where $p$ is a prime number and $f\left( u\right) =u^{p}-u$, with $s\in…
We propose a unified fractional regularization framework for sparse signal recovery based on the $\ell_1/\ell_p^q$ model. This model generalizes several widely used sparsity-promoting regularizers and provides additional flexibility through…
Multi-head finite-state dimensions and predimensions quantify the predictability of a sequence by a gambler with trailing heads acting as "probes to the past." These additional heads allow the gambler to exploit patterns that are simple but…
Change of measure inequalities translate divergences between probability measures into explicit bounds on event probabilities, and play an important role in deriving probabilistic guarantees in learning theory, information theory, and…
The automorphism group of a code is the group of permutations that map a code to itself. Berman codes are a class of binary linear codes characterized by two integer parameters $n\geq 2$ and $m\geq 1$, and this class includes the…
A transmitting intelligent surfaces (TISs) aided satellite indoor navigation system is investigated. By leveraging the unique features of TIS, we address the limitations of conventional global navigation satellite systems (GNSS) in…
The increasing densification of small-cell networks substantially expands cable-based backhaul infrastructure, creating heightened vulnerability to cable link failures. This paper proposes a reconfigurable intelligent surface (RIS)-assisted…
Pinching antenna systems (PASS) enable reconfigurable radiating elements and extended line-of-sight communication, mitigating path loss effects. However, existing designs lack fully controllable radiation weights, as they are governed by…
Practical ISAC is constrained by static clutter and NLoS multipath, which obscure target-coupled echoes and induce spurious peaks for beam alignment. Existing receiver-side methods largely model targets as passive scatterers, limiting the…
In joint multiuser decoding, a receiver recovers a set of messages from a single noisy aggregate of many simultaneous transmissions. Classical decoders rely on rule-based mechanisms such as successive interference cancellation, joint belief…