Constructing Partial MDS Codes from Reducible Algebraic Curves
DOI10.1137/20M1356658MaRDI QIDQ5020843
Anna-Lena Horlemann-Trautmann, Alessandro Neri, Mauricio Velasco, David A. Karpuk, Tristram C. Bogart
Publication date: 7 January 2022
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2007.14829
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Special algebraic curves and curves of low genus (14H45) Applications to coding theory and cryptography of arithmetic geometry (14G50) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A complete classification of partial MDS (maximally recoverable) codes with one global parity
- Random construction of partial MDS codes
- Optimal Locally Repairable Codes and Connections to Matroid Theory
- On the Combinatorics of Locally Repairable Codes via Matroid Theory
- Construction of Partial MDS and Sector-Disk Codes With Two Global Parity Symbols
- Locally Repairable Codes
- Explicit Maximally Recoverable Codes With Locality
- A Family of Optimal Locally Recoverable Codes
- Which linear codes are algebraic-geometric?
- Bertini irreducibility theorems over finite fields
- Maximally Recoverable LRCs: A Field Size Lower Bound and Constructions for Few Heavy Parities
- Constructions of Maximally Recoverable Local Reconstruction Codes via Function Fields
- Universal and Dynamic Locally Repairable Codes With Maximal Recoverability via Sum-Rank Codes
- Constructions of Partial MDS Codes Over Small Fields
- Partial-MDS Codes and Their Application to RAID Type of Architectures
- Optimal Locally Repairable and Secure Codes for Distributed Storage Systems
