Constructing Partial MDS Codes from Reducible Curves

DOI10.1137/20M1356658MaRDI QIDQ6346102arXivFDO

Authors Tristram Bogart, Anna-Lena Horlemann-Trautmann, David A. Karpuk, Alessandro Neri, Mauricio Velasco

Publication date 29 July 2020

Published in arXiv

Full work available at URL https://doi.org/10.1137/20M1356658

Mathematics Subject Classification ID

Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50) Special algebraic curves and curves of low genus (14H45) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

arXiv classification

cs.ITmath.AGmath.COmath.IT

Abstract: We propose reducible algebraic curves as a mechanism to construct Partial MDS (PMDS) codes geometrically. We obtain new general existence results, new explicit constructions and improved estimates on the smallest field sizes over which such codes can exist. Our results are obtained by combining ideas from projective algebraic geometry, combinatorics and probability theory.

This page was built for publication: Constructing Partial MDS Codes from Reducible Curves

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