Random construction of partial MDS codes

DOI10.1007/s10623-019-00705-xzbMath1454.94128arXiv1801.05848OpenAlexW2995134452WikidataQ126546158 ScholiaQ126546158MaRDI QIDQ2306906

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

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

Related Items (6)

A construction of maximally recoverable codes ⋮ A General Family of MSRD Codes and PMDS Codes with Smaller Field Sizes from Extended Moore Matrices ⋮ Equivalence and characterizations of linear rank-metric codes based on invariants ⋮ Roos bound for skew cyclic codes in Hamming and rank metric ⋮ Codes in the Sum-Rank Metric: Fundamentals and Applications ⋮ Constructing Partial MDS Codes from Reducible Algebraic Curves

Cites Work

• Unnamed Item
• A new family of linear maximum rank distance codes
• Theory of codes with maximum rank distance
• On the genericity of maximum rank distance and Gabidulin codes
• A complete classification of partial MDS (maximally recoverable) codes with one global parity
• New criteria for MRD and Gabidulin codes and some rank-metric code constructions
• 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
• Partial-MDS Codes and Their Application to RAID Type of Architectures
• Maximum-rank array codes and their application to crisscross error correction

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