Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1004.3085

Universal Coding of Ergodic Sources for Multiple Decoders with Side Information

Shigeaki Kuzuoka·Akisato Kimura·Tomohiko Uyematsu
View original source ↗Read source document ↗Export metadata ↓

Abstract

A multiterminal lossy coding problem, which includes various problems such as the Wyner-Ziv problem and the complementary delivery problem as special cases, is considered. It is shown that any point in the achievable rate-distortion region can be attained even if the source statistics are not known.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Shigeaki Kuzuoka, Akisato Kimura, Tomohiko Uyematsu. 2010-04-19. Universal Coding of Ergodic Sources for Multiple Decoders with Side Information. https://arxiv.org/abs/1004.3085

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Fundamental Limits of MIMO ISAC: An Antenna Array Architecture Perspective

This paper investigates the fundamental limits of MIMO integrated sensing and communications (ISAC) systems, specifically comparing sparse arrays (SAs) against conventional uniform linear arrays (ULAs). A unified theoretical analysis of ergodic channel capacity and the Cramér$\unicode{x2013}$Rao bound (CRB) for angle estimation is developed while accounting for the array geometry. Utilizing the framework of stochastic majorization, the study reveals that SAs consistently outperform ULAs by creating a more $\unicode{x201C}$uniform$\unicode{x201D}$ spatial eigenvalue distribution, which decorrelates the multipath environment and increases communication capacity. For sensing, the paper proves that the angle CRB is inversely proportional to the array's second-order central moment of antenna positions asymptotically, demonstrating that SAs achieve superior accuracy$\unicode{x2014}$improving by up to the square of the number of antennas$\unicode{x2014}$due to their increased physical aperture. These analyses and conclusions are demonstrated to be also valid for MIMO ISAC systems employed with the modern waveforms OTFS and OFDM, suggesting that spatial geometry, rather than waveform, is the primary driver of fundamental performance gains in the spatial dimension.

cs.IT↗
arXiv2026

Worse Routes, Fresher Information: Preemption Redefines Which Route is Best

This paper studies joint sampling, route activation, and preemption control over $N$ heterogeneous transmission routes under a long-run objective combining Age of Information (AoI) with sampling and transmission costs. We formulate the problem as an average-cost impulse-control model, derive a vector-form integral average-cost optimality equation over a hybrid state space, and establish structural reductions on the state. We consider a two-route case and compute optimized policies using discretized policy iteration. Surprisingly, the results show that preemption can reverse routing preferences: the optimized policy may exclusively use a route with both a larger mean delay and a larger delay variance while avoiding the seemingly superior route. Relative to baselines that do not allow preemption, the proposed policy reduces average AoI by up to $96\%$.

cs.IT↗
arXiv2026

Weight spectra of some families of GRM codes

Let $\mathrm{RM}_q(r,m)$ denote the generalized Reed--Muller code of order $r$ and length $q^m$ over the finite field $\mathbb{F}_q$. We completely determine the weight spectra of $\mathrm{RM}_3(2m-i,m)$ for $i=3,4$, $\mathrm{RM}_4(3m-i,m)$ for $i=2,3$, $\mathrm{RM}_5(4m-4,m)$, and $\mathrm{RM}_7(6m-4,m)$, in the ranges of $m$ specified in the corresponding results. The proofs proceed by induction on $m$, using a sumset inclusion for GRM weight spectra together with results on low-weight codewords. The required base cases are established by computations in Magma and, for certain ternary cases, exact constraint solving with Z3.

cs.IT↗