信息论
Interference management is a central bottleneck in dense multi-antenna wireless networks. Therefore, in this study, we present a digital precoding-free hierarchical rate-splitting multiple access (HRSMA) architecture assisted by a stacked…
Stacked intelligent metasurfaces (SIMs) have recently gained attention as a paradigm for wave-domain signal processing with reduced reliance on costly radio-frequency (RF) chains. However, conventional SIMs rely on uniform inter-layer…
The evolution of human intelligence led to the huge amount of data in the information space. Accessing and processing this data helps in finding solutions to applied problems based on finite-dimensional models. We argue, that formally, such…
We consider computing systems that partition jobs into tasks, add redundancy through coding, and assign the encoded tasks to different computing nodes for parallel execution. The expected execution time depends on the level of redundancy.…
We study the possibility of scaling down algorithmic information quantities in tuples of correlated strings. In particular, we address a question raised by Alexander Shen: whether, for any triple of strings $(a, b, c)$, there exists a…
Due to their sequential nature, traditional DNA synthesis methods are expensive in terms of time and resources. They also fabricate multiple copies of the same strand, introducing redundancy. This redundancy can be leveraged to enhance the…
As mission- and safety-critical wireless applications grow in complexity and diversity, next-generation wireless systems must meet increasingly stringent and multifaceted requirements. These systems demand resilience along with enhanced…
Composite DNA is a recent method to increase the base alphabet size in DNA-based data storage.This paper models synthesizing and sequencing of composite DNA and introduces coding techniques to correct substitutions, losses of entire…
We construct a randomized vector quantizer which has a smaller maximum error compared to all known lattice quantizers with the same entropy for dimensions 5, 6, ..., 48, and also has a smaller mean squared error compared to known lattice…
In this paper, we present two constructions of degraded read friendly (DRF) MDS array codes with two parity nodes and a sub-packetization level of 2 over small finite fields, applicable for any arbitrary code length. The first construction…
Federated learning (FL) in wireless networks is limited by straggler delays from unpredictable channel conditions. In this paper, we investigate the pinching-antenna system (PASS), which dynamically 'pinches' the radiator along a dielectric…
The information fusion field has recently been attracting a lot of interest within the scientific community, as it provides, through the combination of different sources of heterogeneous information, a fuller and/or more precise…
The polar codes introduced by Arikan in 2009 achieve the capacity of binary-input discrete memoryless channels (BIDMCs) with low complexity encoding and decoding. Identifying the unreliable synthetic channels, generated by Arikan…
An end-to-end learning method for constellation shaping with a shaping-encoder assisted transceiver architecture is presented. The shaping encoder, which produces shaping bits with a higher probability of zeros, is used to produce an…
Future immersive XR applications will require energy-efficient, high data rate, and low-latency wireless communications in uplink and downlink. One of the key considerations for supporting such XR applications is intelligent and adaptive…
Unmanned aerial vehicle (UAV)-enabled mobile edge computing (MEC) systems can use different multiple access schemes to coordinate multi-user task offloading. However, it is still unknown which scheme is the most energy-efficient, especially…
In distributed sensor networks, sensors often observe a dynamic process within overlapping regions. Due to random delays, these correlated observations arrive at the fusion center asynchronously, raising a central question: How can one fuse…
R. W. Hamming published the Hamming codes and the sphere packing bound in 1950. In the past 75 years, infinite families of distance-optimal linear codes over finite fields with minimum distance at most 8 with respect to the sphere packing…
Channel estimation for massive multiple-input multiple-output (MIMO) systems is fundamentally constrained by excessive pilot overhead and high estimation latency. To overcome these obstacles, recent studies have leveraged deep generative…
Coded caching is a promising technique to create coded multicast opportunities for cache-aided networks. By splitting each file into $F$ equal packets (i.e., the subpacketization level $F$) and letting each user cache a set of packets, the…