A Construction of Maximally Recoverable Codes With Order-Optimal Field Size
نویسندگان
چکیده
We construct maximally recoverable codes (corresponding to partial MDS codes) which are based on linearized Reed-Solomon codes. The new have a smaller field size requirement compared with known constructions. For certain asymptotic regimes, the constructed order-optimal alphabet size, asymptotically matching lower bound.
منابع مشابه
On Maximally Recoverable Codes for Product Topologies
Given a topology of local parity-check constraints, a maximally recoverable code (MRC) can correct all erasure patterns that are information-theoretically correctable. In a grid-like topology, there are a local constraints in every column forming a column code, b local constraints in every row forming a row code, and h global constraints in an (m × n) grid of codeword. Recently, Gopalan et al. ...
متن کاملOn Maximally Recoverable Local Reconstruction Codes
In recent years the explosion in the volumes of data being stored online has resulted in distributed storage systems transitioning to erasure coding based schemes. Local Reconstruction Codes (LRCs) have emerged as the codes of choice for these applications. An (n, r ,h,a,q)-LRC is a q-ary code, where encoding is as a two stage process. In the first stage, h redundant parity symbols are generate...
متن کاملMaximally Recoverable Codes for Grid-like Topologies
The explosion in the volumes of data being stored online has resulted in distributed storage systems transitioning to erasure coding based schemes. Yet, the codes being deployed in practice are fairly short. In this work, we address what we view as the main coding theoretic barrier to deploying longer codes in storage: at large lengths, failures are not independent and correlated failures are i...
متن کاملA Complete Classification of Partial-MDS (Maximally Recoverable) Codes with One Global Parity
Partial-MDS (PMDS) codes are a family of locally repairable codes, mainly used for distributed storage. They are defined to be able to correct any pattern of s additional erasures, after a given number of erasures per locality group have occurred. This makes them also maximally recoverable (MR) codes, another class of locally repairable codes. Both terms will be properly defined in the next sec...
متن کاملA Construction of Optimal Constant Composition Codes
In this paper, a construction of optimal constant composition codes is developed, and used to derive some series of new optimal constant composition codes meeting the upper bound given by [13].
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2022
ISSN: ['0018-9448', '1557-9654']
DOI: https://doi.org/10.1109/tit.2021.3120016