Search · four archives
Search · four archives
18 papers · ranked by Valyu relevance
Meixia Tao, Kai Niu, Youlong Wu
Traditional information theory provides a rigorous foundation for information compression and reliable symbol transmission. However, in emerging applications such as autonomous driving, remote healthcare, and industrial Internet of Things (IoT), the key communication challenge has been shifted from accurate delivery of…
Haobo Jia, Zhuqing Jia, Shenghui Song
We study the problem of locally encoded secure distributed batch matrix multiplication (LESDBMM), where M pairs of sources each encode their respective batches of massive matrices and distribute the generated shares to a subset of N worker nodes. Each worker node computes a response from the received shares and sends…
Muhammed Yusuf Sener, Gerhard Kramer, Shlomo Shamai, Ronald Böhnke + 1 more
Scalar quantization and probabilistic shaping are applied to the distributed source coding of Gaussian sources, with mean-square error distortion. A coding scheme with a modulo interval, dithering, and truncated Gaussian shaping is shown to achieve the corner points of the Berger-Tung region. The theory is illustrated…
Rimpi Borah, J. Harshan
Coded computing is a reliable and fault-tolerant paradigm for executing large-scale computational tasks over distributed worker nodes. Among existing coded computing frameworks, Berrut Approximated Coded Computing (BACC) enables distributed computation of arbitrary non-polynomial functions through rational…
Song, Heekang, Choi, Wan
In this paper, we propose an optimally structured gradient coding scheme to mitigate the straggler problem in distributed learning. Conventional gradient coding methods often assume homogeneous straggler models or rely on excessive data replication, limiting performance in real-world heterogeneous systems. To address…
Hanlin Zhu, Assia Chericoni, Taha Ismail, Elizabeth A. Mickiewicz + 17 more
Humans handle numbers nimbly, suggesting a richer neural manifold structure than the prevalent mental number line model. In populations of medial temporal lobe (MTL) neurons in humans performing two simple tasks (dot counting and arithmetic), we find robust neural coding of numerosity that results in high dimensional…
Hiram Lopez, Gretchen L. Matthews, Daniel Valvo
A distributed storage system stores data across multiple nodes, with the primary objective of enabling efficient data recovery even in the event of node failures. The main goal of an exact repair scheme is to recover the data from a failed node by accessing and downloading information from the rest of the nodes. In a…
M Kalinova, B Kerkova, A Kalina, V Pytelova + 8 more
Arithmetic requires complex and fast processes orchestrated within a large-scale network spanning multiple brain regions. However, reports on the network’s temporal dynamics are scarce. Here, we present data from intracranial EEG (iEEG) of 20 subjects (epilepsy surgery candidates) performing a sequential three-operand…
Onur Günlü, Maciej Skorski, H. Vincent Poor, Chi Wan Sung
Semantic communication frameworks aim to convey the underlying significance of data rather than reproducing it exactly, a perspective that enables substantial efficiency gains in settings constrained by latency or bandwidth. Motivated by this shift, we study the rate-distortion-perception (RDP) trade-off for image…
Ruoyu Meng, Aditya Ramamoorthy
In this work, we consider the problem of computing a linear combination over a noiseless quantum many-to-one network. There are $k$ senders, Alice$_1$, $\ldots$, Alice$_k$, and a single receiver, Bob. Each Alice$_i$ has a data vector $W_i \in \mathbb{F}^{m_i}$, where $\mathbb{F}$ is a finite field. Bob wants to compute…
Yuxin Jiang, Wenqin Zhang, Lele Wang
Gradient coding is a distributed computing technique aiming to provide robustness against slow or non-responsive computing nodes, known as stragglers, while balancing the computational load for responsive computing nodes. Among existing gradient codes, a construction based on combinatorial designs, called BIBD gradient…
Kees Schouhamer Immink, Jos H. Weber, Tuan Thanh Nguyen, Kui Cai + 2 more
The design of low-complexity and efficient constrained codes has been a major research item for many years. This paper reports on a versatile method named concatenated constrained codes for designing efficient fixed-length constrained codes with small complexity. A concatenated constrained code comprises two (or more)…
Vojtech Macala, Petr Simecek
Lossless compression and probabilistic sequence modeling are two faces of the same coin: a model that assigns high probability to a sequence can encode it in few bits via arithmetic coding. We exploit this duality to evaluate genomic language models as compressors of DNA, using compression primarily as an objective…
Alex Shepherd, Emily Stone, Lucy L. W. Owen
Naturalistic cognition emerges from coordinated interactions among distributed brain systems operating across multiple representational scales. Characterizing this organization remains challenging because cognitively relevant information is embedded within high-dimensional neural activity. Here, we apply Multisubject…
Tao Guo, Zhangyao Song, Huihui Wu, Yang Li + 1 more
This paper analyzes the semantic rate-distortion problem motivated by task-oriented data compression with side information. The semantic information related to a task is not directly accessible to the encoder but implicitly impacts the observations through a joint probability distribution. The decoder aims to…
Yumeng Yang, Han Cai, Xianfu Lei, Xiaohu Tang
In this paper, we study convertible codes in the merge regime and focus on the minimum storage regenerating (MSR) setting, where both the initial codes and the final code admit optimal single-node repair. We propose explicit MSR-to-MSR conversion schemes and analyze their performance in terms of access cost and…
Muhammed Yusuf Şener, Gerhard Kramer, Shlomo Shamai (Shitz), Ronald Böhnke + 2 more
Dirty paper coding (DPC) is applied to multi-input multi-output (MIMO) broadcast channels with additive Gaussian noise and one message per receiver. The method decomposes each receiver MIMO channel into parallel scalar channels and applies modulo operators, amplitude-shift keying (ASK), and probabilistic shaping. The…
Ying Chen, Jianrong Bao, Yanhai Shang, Chao Liu + 5 more
To obtain efficient channel codes with high power efficiency at moderate signal-to-noise ratios (SNRs), an efficient high-rate protograph quasi-cyclic (QC) low-density parity-check (LDPC) codes is optimally constructed. By an optimized protograph template, the code framework is firstly produced by the extensions of the…