Universal and Dynamic Locally Repairable Codes With Maximal Recoverability via Sum-Rank Codes

DOI10.1109/TIT.2019.2924888zbMath1433.94127arXiv1809.11158OpenAlexW2956089011WikidataQ127625344 ScholiaQ127625344MaRDI QIDQ5211540

Umberto Martínez-Peñas, Frank R. Kschischang

Publication date: 28 January 2020

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Cyclic codes (94B15)

Related Items (17)

A construction of maximally recoverable codes ⋮ Anticodes in the sum-rank metric ⋮ Sum-rank product codes and bounds on the minimum distance ⋮ Zeros with multiplicity, Hasse derivatives and linear factors of general skew polynomials ⋮ Twisted linearized Reed-Solomon codes: a skew polynomial framework ⋮ A General Family of MSRD Codes and PMDS Codes with Smaller Field Sizes from Extended Moore Matrices ⋮ Systematic maximum sum rank codes ⋮ Constructions of optimal rank-metric codes from automorphisms of rational function fields ⋮ Fast Kötter-Nielsen-Høholdt interpolation over skew polynomial rings and its application in coding theory ⋮ Interpolation-based decoding of folded variants of linearized and skew Reed-Solomon codes ⋮ Theory of supports for linear codes endowed with the sum-rank metric ⋮ Hamming and simplex codes for the sum-rank metric ⋮ The geometry of one-weight codes in the sum-rank metric ⋮ Rank-Metric Codes and Their Applications ⋮ Codes for Distributed Storage ⋮ Codes in the Sum-Rank Metric: Fundamentals and Applications ⋮ Constructing Partial MDS Codes from Reducible Algebraic Curves

This page was built for publication: Universal and Dynamic Locally Repairable Codes With Maximal Recoverability via Sum-Rank Codes