Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 1206.1389

Lossy Computing of Correlated Sources with Fractional Sampling

Xi Liu·Osvaldo Simeone·Elza Erkip
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper considers the problem of lossy compression for the computation of a function of two correlated sources, both of which are observed at the encoder. Due to presence of observation costs, the encoder is allowed to observe only subsets of the samples from both sources, with a fraction of such sample pairs possibly overlapping. The rate-distortion function is characterized for memory-less sources, and then specialized to Gaussian and binary sources for selected functions and with quadratic and Hamming distortion metrics, respectively. The optimal measurement overlap fraction is shown to depend on the function to be computed by the decoder, on the source statistics, including the correlation, and on the link rate. Special cases are discussed in which the optimal overlap fraction is the maximum or minimum possible value given the sampling budget, illustrating non-trivial performance trade-offs in the design of the sampling strategy. Finally, the analysis is extended to the multi-hop set-up with jointly Gaussian sources, where each encoder can observe only one of the sources.

Explore related subjects

cs.ITmath.IT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Xi Liu, Osvaldo Simeone, Elza Erkip. 2013-07-19. Lossy Computing of Correlated Sources with Fractional Sampling. https://arxiv.org/abs/1206.1389

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

KEEP EXPLORING

Related papers

arXiv2026

A generalization of the map $χ$

The mapping $ χ_n:\mathbb{F}_2^n \to \mathbb{F}_2^n$ defined by $y=χ_n(x)$ with $y_i = x_i + x_{i+1}x_{i+2} + x_{i+2}$, where the indices are computed modulo $n$, has been widely studied for its application in lightweight cryptography. In this paper, we generalize this mapping and completely characterize all these shift-invariant permutations of the form $y_i=x_{i+u}+x_{i+v}(x_{i+w}+a_i)$, where $0\le u, v, w<n$ and $a_i\in \mathbb{F}_2$, $1\le i\le n$.

cs.IT↗
arXiv2026

FlashSAM: Lightweight Vision Model for Multi-UAV Token Communication in Low-Latitude Wireless Networks

Token Communication (TokenCom) is a promising paradigm for low-altitude wireless networks, as it focuses on transmitting task-relevant core information, particularly in environments with uncertainty, noise, and stringent bandwidth constraints. However, existing TokenCom systems still face several challenges, including inefficient knowledge base construction, ineffective token encoding, and limited support for multi-user token sharing. To address these issues, we propose a Lightweight Vision Model-based Multi-Unmanned Aerial Vehicle (UAV) Token Communication (LVM-MTC) system. First, we develop a lightweight Segment Anything Model (SAM), termed FlashSAM, which incorporates a set of lightweight convolutional modules to significantly reduce the number of model parameters. Building on FlashSAM, we construct a Lightweight Knowledge Base (LKB) to enable efficient object-level perception. Next, we design an Efficient Token Codec (ETC) based on the Masked Autoencoder (MAE) architecture. ETC improves compression efficiency at both the pixel and token levels, and provides lightweight token decoding tailored for resource-constrained UAVs. Furthermore, we propose a Multi-UAV Token Sharing (MTS) scheme for multi-UAV TokenCom. By measuring token similarity across UAVs, MTS consolidates similar tokens and transmits them through broadcast transmission, thereby further improving transmission efficiency. Finally, simulation results validate the feasibility and effectiveness of the proposed LVM-MTC system.

cs.IT↗
arXiv2026

Coding for Multiple Reverse-Complement and Palindromic Duplications

Reverse-complement (RC) and palindromic (PAL) duplications copy a length-$k$ block, reverse the copy, and insert it immediately after the original block; an RC duplication also complements the copied symbols. We study $q$-ary codes correcting $t$ such operations performed sequentially, so a later operation may copy symbols created by an earlier one. For fixed $q\geq2$ and $k,t\geq1$, every length-$n$ code $C$ for either channel satisfies $n-\log_q|C|\geq t\log_q n-O_{q,k,t}(1)$; for fixed $q,k$ and $1\leq t=t(n)=o(n)$ the lower bound is $t\log_q(n/t)-O_{q,k}(t)$. For a single RC error over an even alphabet with a fixed-point-free complement, the previously known RC-specific lift applies at odd $k$ and does not cover even $k$. For every even $k$ and any involutive complement, we give a coordinate-wise bijection that turns each RC duplication into a PAL duplication. Applying this bijection to every codeword therefore converts any $t$-error-correcting RC code into a PAL code of the same size, and conversely; encoders and decoders transfer by adding linear-time coordinate passes. For every even $k$, we also determine the maximum number of distinct descendants produced by exactly two errors from one source word. Words alternating between any two distinct alphabet symbols attain this maximum for PAL, and the bijection gives the RC maximizers. For both PAL and RC at fixed even $k$, we prove the existence of two-error-correcting codes with redundancy $4\log_q n+O_{q,k}(1)$. In the binary two-error problem, the converse gives $2\log_2 n-O_k(1)$, leaving a factor-two gap in the best existence bounds.

cs.IT↗