English
Related papers

Related papers: Lower Bound on the Optimal Access Bandwidth of ($K…

200 papers

It has been shown that maximum distance profile (MDP) convolutional codes have optimal recovery rate for windows of a certain length, when transmitting over an erasure channel. In addition, the subclass of complete MDP convolutional codes…

Information Theory · Computer Science 2018-08-10 Julia Lieb

Partial MDS (PMDS) and sector-disk (SD) codes are classes of erasure codes that combine locality with strong erasure correction capabilities. We construct PMDS and SD codes where each local code is a bandwidth-optimal regenerating MDS code.…

Information Theory · Computer Science 2020-05-11 Lukas Holzbaur , Sven Puchinger , Eitan Yaakobi , Antonia Wachter-Zeh

Distributed storage systems that deploy erasure codes can provide better features such as lower storage overhead and higher data reliability. In this paper, we focus on fractional repetition (FR) codes, which are a class of storage codes…

Information Theory · Computer Science 2020-05-15 Bing Zhu , Kenneth W. Shum , Hui Li

Distributed storage systems must store large amounts of data over long periods of time. To avoid data loss due to device failures, an $[n,k]$ erasure code is used to encode $k$ data symbols into a codeword of $n$ symbols that are stored…

Information Theory · Computer Science 2022-05-16 Francisco Maturana , K. V. Rashmi

The repair bandwidth of a code is the minimum amount of data required to repair one or several failed nodes (erasures). For MDS codes, the repair bandwidth is bounded below by the so-called cut-set bound, and codes that meet this bound with…

Information Theory · Computer Science 2017-10-20 Min Ye , Alexander Barg

Array codes have been widely employed in storage systems, such as Redundant Arrays of Inexpensive Disks (RAID). The row-diagonal parity (RDP) codes and EVENODD codes are two popular double-parity array codes. As the capacity of hard disks…

Information Theory · Computer Science 2018-03-12 Hanxu Hou , Yunghsiang S. Han , Kenneth W. Shum , Hui Li

Erasure coding has been recognized as a powerful method to mitigate delays due to slow or straggling nodes in distributed systems. This work shows that erasure coding of data objects can flexibly handle skews in the request rates. Coding…

Information Theory · Computer Science 2021-06-29 Mehmet Aktas , Gauri Joshi , Swanand Kadhe , Fatemeh Kazemi , Emina Soljanin

In large data centers, storage nodes are organized in racks, and the cross-rack transmission dominates the bandwidth cost. For the repair of single node failures, codes achieving the tradeoff between the storage redundancy and cross-rack…

Information Theory · Computer Science 2022-05-19 Liyang Zhou , Zhifang Zhang

A primary source of increased read time on NAND flash comes from the fact that in the presence of noise, the flash medium must be read several times using different read threshold voltages for the decoder to succeed. This paper proposes an…

Information Theory · Computer Science 2022-02-14 Borja Peleato , Rajiv Agarwal , John Cioffi , Minghai Qin , Paul H. Siegel

Node failures are inevitable in distributed storage systems (DSS). To enable efficient repair when faced with such failures, two main techniques are known: Regenerating codes, i.e., codes that minimize the total repair bandwidth; and codes…

In a distributed storage network, reliability and bandwidth optimization can be provided by regenerating codes. Recently table based regenerating codes viz. DRESS (Distributed Replication-based Exact Simple Storage) codes has been proposed…

Information Theory · Computer Science 2013-02-18 Manish K Gupta , Anupam Agrawal , Deepak Yadav

Partial MDS (PMDS) and sector-disk (SD) codes are classes of erasure correcting codes that combine locality with strong erasure correction capabilities. We construct PMDS and SD codes with local regeneration where each local code is a…

Information Theory · Computer Science 2021-06-14 Lukas Holzbaur , Sven Puchinger , Eitan Yaakobi , Antonia Wachter-Zeh

This paper addresses the problem of constructing secure exact-repair regenerating codes at the MSR point for all feasible values of the parameters. The setting involves a passive eavesdropper who is allowed to observe the stored contents…

Information Theory · Computer Science 2019-02-27 V. Arvind Rameshwar , Navin Kashyap

We consider distributed storage (DS) for a wireless network where mobile devices arrive and depart according to a Poisson random process. Content is stored in a number of mobile devices, using an erasure correcting code. When requesting a…

Information Theory · Computer Science 2016-01-05 Jesper Pedersen , Alexandre Graell i Amat , Iryna Andriyanova , Fredrik Brännström

This paper presents a new construction of error correcting codes which achieves optimal recovery of a streaming source over a packet erasure channel. The channel model considered is the sliding window erasure model, with burst and arbitrary…

Information Theory · Computer Science 2019-04-23 Damian Dudzicz , Silas L. Fong , Ashish Khisti

The newly presented $(k+2,k)$ Hadamard minimum storage regenerating (MSR) code is the first class of high rate storage code with optimal repair property for all single node failures. In this paper, we propose a new simple repair strategy,…

Information Theory · Computer Science 2013-12-19 Xiaohu Tang , Bin Yang , Jie Li

Data storage applications require erasure-correcting codes with prescribed sets of dependencies between data symbols and redundant symbols. The most common arrangement is to have $k$ data symbols and $h$ redundant symbols (that each depends…

Information Theory · Computer Science 2016-05-10 Guangda Hu , Sergey Yekhanin

Reconfigurable distributed antenna and reflecting surface (RDARS) is a new architecture for the sixth-generation (6G) millimeter wave (mmWave) communications. In RDARS-aided mmWave systems, the active and passive beamforming design and…

Signal Processing · Electrical Eng. & Systems 2025-04-03 Chengwang Ji , Qing Xue , Haiquan Lu , Jintao Wang , Qiaoyan Peng , Shaodan Ma , Wei Zhang

The integration of multicarrier modulation and multiple-input-multiple-output (MIMO) is critical for reliable transmission of wireless signals in complex environments, which significantly improve spectrum efficiency. Existing studies have…

Information Theory · Computer Science 2026-01-09 Yuhao Chi , Zhiyuan Peng , Lei Liu , Ying Li , Yao Ge , Chau Yuen

Minimal codes are linear codes where all non-zero codewords are minimal, i.e., whose support is not properly contained in the support of another codeword. The minimum possible length of such a $k$-dimensional linear code over $\mathbb{F}_q$…

Combinatorics · Mathematics 2025-06-06 Vladimir Chubenko , Sascha Kurz