A complete classification of partial MDS (maximally recoverable) codes with one global parity

DOI10.3934/amc.2020006zbMath1472.94080arXiv1707.00847OpenAlexW2968589674MaRDI QIDQ2008869

Alessandro Neri, Anna-Lena Horlemann-Trautmann

Publication date: 26 November 2019

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

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

zbMATH Keywords

MDS codeslocally repairable codesMDS conjecturemaximally recoverable codespartial MDS codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Other types of codes (94B60)

Related Items (4)

A General Family of MSRD Codes and PMDS Codes with Smaller Field Sizes from Extended Moore Matrices ⋮ Random construction of partial MDS codes ⋮ Rank-Metric Codes and Their Applications ⋮ Constructing Partial MDS Codes from Reducible Algebraic Curves

This page was built for publication: A complete classification of partial MDS (maximally recoverable) codes with one global parity