English
Related papers

Related papers: Partial-MDS Codes and their Application to RAID Ty…

200 papers

For high-rate maximum distance separable (MDS) codes, most of them are designed to optimally repair a single failed node by connecting all the surviving nodes. However, in practical systems, sometimes not all the surviving nodes are…

Information Theory · Computer Science 2021-07-22 Yi Liu , Jie Li , Xiaohu Tang

A linear code with parameters $[n, k, n - k + 1]$ is called maximum distance separable (MDS), and one with parameters $[n, k, n - k]$ is called almost MDS (AMDS). A code is near-MDS (NMDS) if both it and its dual are AMDS. NMDS codes…

Combinatorics · Mathematics 2026-04-07 Hengfeng Liu , Chunming Tang , Zhengchun Zhou , Dongchun Han , Hao Chen

DNA storage systems face significant challenges, including insertion, deletion, and substitution (IDS) errors. Therefore, designing effective synchronization codes, i.e., codes capable of correcting IDS errors, is essential for DNA storage…

Information Theory · Computer Science 2025-05-23 Javad Haghighat , Tolga M. Duman

In the modern era of large-scale computing systems, a crucial use of error correcting codes is to judiciously introduce redundancy to ensure recoverability from failure. To get the most out of every byte, practitioners and theorists have…

Information Theory · Computer Science 2026-02-26 Joshua Brakensiek , Venkatesan Guruswami

With the increase of huge amounts of data in volume, velocity, and variety, the need for capacity of Redundant Arrays of Inexpensive Disks (RAID) storage systems is dramatically growing. However, the probability of disk failures in RAID…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-09-15 De-zhai Yuan , Xing-yi Peng , Ting Liu , Zhe Cui

We present a generalisation of Twisted Reed-Solomon codes containing a new large class of MDS codes. We prove that the code class contains a large subfamily that is closed under duality. Furthermore, we study the Schur squares of the new…

Information Theory · Computer Science 2018-05-14 Peter Beelen , Martin Bossert , Sven Puchinger , Johan Rosenkilde

An $[n,k,d]$ linear code is said to be maximum distance separable (MDS) or almost maximum distance separable (AMDS) if $d=n-k+1$ or $d=n-k$, respectively. If a code and its dual code are both AMDS, then the code is said to be near maximum…

Information Theory · Computer Science 2025-10-31 Jianbing Lu , Yue Zhou

Linear complementary-dual (LCD for short) codes are linear codes that intersect with their duals trivially. LCD codes have been used in certain communication systems. It is recently found that LCD codes can be applied in cryptography. This…

Information Theory · Computer Science 2017-02-28 Bocong Chen , Hongwei Liu

We construct maximally recoverable codes (corresponding to partial MDS codes) which are based on linearized Reed-Solomon codes. The new codes have a smaller field size requirement compared with known constructions. For certain asymptotic…

Information Theory · Computer Science 2021-10-15 Han Cai , Ying Miao , Moshe Schwartz , Xiaohu Tang

We investigate the problem of maintaining an encoded distributed storage system when some nodes contain adversarial errors. Using the error-correction capabilities that are built into the existing redundancy of the system, we propose a…

Cryptography and Security · Computer Science 2015-03-17 Theodoros K. Dikaliotis , Alexandros G. Dimakis , Tracey Ho

In 1964, Massey introduced a class of codes with complementary duals which are called Linear Complimentary Dual (LCD for short) codes. He showed that LCD codes have applications in communication system, side-channel attack (SCA) and so on.…

Information Theory · Computer Science 2017-10-06 Peter Beelen , Lingfei Jin

Motivated by emerging applications to the edge computing paradigm, we introduce a two-layer erasure-coded fault-tolerant distributed storage system offering atomic access for read and write operations. In edge computing, clients interact…

Distributed, Parallel, and Cluster Computing · Computer Science 2017-06-01 Kishori M. Konwar , N. Prakash , Nancy Lynch , Muriel Medard

Generalized Reed-Solomon (RS) codes are a common choice for efficient, reliable error correction in memory and communications systems. These codes add $2t$ extra parity symbols to a block of memory, and can efficiently and reliably correct…

Information Theory · Computer Science 2024-05-28 Mike Hamburg , Eric Linstadt , Danny Moore , Thomas Vogelsang

Maximum-distance separable (MDS) convolutional codes form an optimal family of convolutional codes, the study of which is of great importance. There are very few general algebraic constructions of MDS convolutional codes. In this paper, we…

Information Theory · Computer Science 2015-11-24 Chin Hei Chan , Maosheng Xiong

For high-rate linear systematic maximum distance separable (MDS) codes, most early constructions could initially optimally repair all the systematic nodes but not all the parity nodes. Fortunately, this issue was first solved by Li et al.…

Information Theory · Computer Science 2021-11-09 Jie Li , Xiaohu Tang , Camilla Hollanti

Systematic constructions of MDS self-dual codes is widely concerned. In this paper, we consider the constructions of MDS Euclidean self-dual codes from short length. Indeed, the exact constructions of MDS Euclidean self-dual codes from…

Information Theory · Computer Science 2019-10-24 Derong Xie , Xiaolei Fang , Jinquan Luo

Existing solid state drive (SSD) simulators unfortunately lack hardware and/or software architecture models. Consequently, they are far from capturing the critical features of contemporary SSD devices. More importantly, while the…

Hardware Architecture · Computer Science 2017-09-15 Myoungsoo Jung , Jie Zhang , Ahmed Abulila , Miryeong Kwon , Narges Shahidi , John Shalf , Nam Sung Kim , Mahmut Kandemir

We revisit zigzag array codes, a family of MDS codes known for achieving optimal access and optimal rebuilding ratio in single-node repair. In this work, we endow zigzag codes with two new properties: small field size and low skip cost.…

Information Theory · Computer Science 2025-09-30 Wenqin Zhang , Han Mao Kiah , Son Hoang Dau

This chapter deals with the topic of designing reliable and efficient codes for the storage and retrieval of large quantities of data over storage devices that are prone to failure. For long, the traditional objective has been one of…

Information Theory · Computer Science 2020-10-06 Vinayak Ramkumar , Myna Vajha , S. B. Balaji , M. Nikhil Krishnan , Birenjith Sasidharan , P. Vijay Kumar

SSDs are emerging storage devices which unlike HDDs, do not have mechanical parts and therefore, have superior performance compared to HDDs. Due to the high cost of SSDs, entirely replacing HDDs with SSDs is not economically justified.…

Performance · Computer Science 2018-12-12 Reza Salkhordeh , Mostafa Hadizadeh , Hossein Asadi
‹ Prev 1 4 5 6 7 8 10 Next ›