AI Chat AI Image Generator AI Video Text to Speech

A Construction of Maximally Recoverable Codes with Order-Optimal Field Size

11/27/2020

∙

by Han Cai, et al.

∙

∙

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 regimes, the constructed codes have order-optimal alphabet size, asymptotically matching the known lower bound.

Han Cai
27 publications
Ying Miao
10 publications
Moshe Schwartz
30 publications
Xiaohu Tang
41 publications

page 1

page 2

page 3

page 4

research

∙ 01/14/2020

Partial MDS Codes with Local Regeneration

Partial MDS (PMDS) and sector-disk (SD) codes are classes of erasure cod...

0 Lukas Holzbaur, et al. ∙

research

∙ 12/21/2022

Improved Field Size Bounds for Higher Order MDS Codes

Higher order MDS codes are an interesting generalization of MDS codes re...

0 Joshua Brakensiek, et al. ∙

research

∙ 01/02/2022

A Bound on the Minimal Field Size of LRCs, and Cyclic MR Codes That Attain It

We prove a new lower bound on the field size of locally repairable codes...

0 Han Cai, et al. ∙

research

∙ 04/02/2018

Explicit MSR Codes with Optimal Access, Optimal Sub-Packetization and Small Field Size for d = k+1, k+2, k+3

This paper presents the construction of an explicit, optimal-access, hig...

0 Myna Vajha, et al. ∙

research

∙ 06/06/2019

Uniform Minors in Maximally Recoverable Codes

In this letter, locally recoverable codes with maximal recoverability ar...

0 Matthias Grezet, et al. ∙

research

∙ 01/09/2019

Codes for Updating Linear Functions over Small Fields

We consider a point-to-point communication scenario where the receiver m...

0 Suman Ghosh, et al. ∙

research

∙ 03/18/2023

MSR codes with linear field size and smallest sub-packetization for any number of helper nodes

The sub-packetization ℓ and the field size q are of paramount importance...

0 Guodong Li, et al. ∙