Random construction of partial MDS codes

DOI10.1007/S10623-019-00705-XMaRDI QIDQ2306906zbMATH OpenOpenAlexWikidataFDO

Authors Alessandro Neri, Anna-Lena Horlemann-Trautmann

Publication date 27 March 2020

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1801.05848

zbMATH Keywords

distributed storagemaximally recoverable codespartial MDS codes

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Linear codes (general theory) (94B05)

Abstract: This work deals with partial MDS (PMDS) codes, a special class of locally repairable codes, used for distributed storage system. We first show that a known construction of these codes, using Gabidulin codes, can be extended to use any maximum rank distance code. Then we define a standard form for the generator matrices of PMDS codes and use this form to give an algebraic description of PMDS generator matrices. This implies that over a sufficiently large finite field a randomly chosen generator matrix in PMDS standard form generates a PMDS code with high probability. This also provides sufficient conditions on the field size for the existence of PMDS codes.

Recommendations

• A complete classification of partial MDS (maximally recoverable) codes with one global parity
• A general family of MSRD codes and PMDS codes with smaller field sizes from extended Moore matrices
• Partial spreads in random network coding
• On lowest density MDS codes
• Lowest density MDS codes over extension alphabets

Cites work

• A complete classification of partial MDS (maximally recoverable) codes with one global parity
• A new family of linear maximum rank distance codes
• Construction of Partial MDS and Sector-Disk Codes With Two Global Parity Symbols
• Explicit Maximally Recoverable Codes With Locality
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• scientific article; zbMATH DE number 1775429 (Why is no real title available?)
• Maximum-rank array codes and their application to crisscross error correction
• New criteria for MRD and Gabidulin codes and some rank-metric code constructions
• On the genericity of maximum rank distance and Gabidulin codes
• Partial-MDS Codes and Their Application to RAID Type of Architectures
• Theory of codes with maximum rank distance

Cited in

(11)

• Enumeration, construction and random generation of block codes
• Roos bound for skew cyclic codes in Hamming and rank metric
• A complete classification of partial MDS (maximally recoverable) codes with one global parity
• A construction of maximally recoverable codes
• Equivalence and characterizations of linear rank-metric codes based on invariants
• Construction of Recursive MDS Diffusion Layers from Gabidulin Codes
• Construction of Partial-Unit-Memory MDS Convolutional Codes
• Constructing Partial MDS Codes from Reducible Algebraic Curves
• A general family of MSRD codes and PMDS codes with smaller field sizes from extended Moore matrices
• Constructions of Partial MDS Codes Over Small Fields
• Codes in the sum-rank metric: fundamentals and applications

This page was built for publication: Random construction of partial MDS codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2306906)