A General Family of MSRD Codes and PMDS Codes with Smaller Field Sizes from Extended Moore Matrices

DOI10.1137/20M1386001zbMath1503.94060arXiv2011.14109OpenAlexW4291999168WikidataQ114074120 ScholiaQ114074120MaRDI QIDQ5099097

Umberto Martínez-Peñas

Publication date: 31 August 2022

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

MDS codeslocally repairable codesMRD codesPMDS codessum-rank metricMoore matricesMSRD codeslinearized Reed-Solomon codes

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Bounds on codes (94B65) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27)

Related Items

Zeros with multiplicity, Hasse derivatives and linear factors of general skew polynomials ⋮ Doubly and triply extended MSRD codes ⋮ The geometry of one-weight codes in the sum-rank metric ⋮ Codes in the Sum-Rank Metric: Fundamentals and Applications

Cites Work

• Unnamed Item
• Unnamed Item
• Theory of codes with maximum rank distance
• A general theory of Vandermonde matrices
• Vandermonde and Wronskian matrices over division rings
• Bilinear forms over a finite field, with applications to coding theory
• On the asymptotic behaviour of some towers of function fields over finite fields
• Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring
• A complete classification of partial MDS (maximally recoverable) codes with one global parity
• A construction of maximally recoverable codes
• Twisted linearized Reed-Solomon codes: a skew polynomial framework
• Group codes on certain algebraic curves with many rational points
• Random construction of partial MDS codes
• Theory of supports for linear codes endowed with the sum-rank metric
• Matroidal structure of skew polynomial rings with application to network coding
• Construction of Partial MDS and Sector-Disk Codes With Two Global Parity Symbols
• Explicit Maximally Recoverable Codes With Locality
• Codes With Local Regeneration and Erasure Correction
• On the Locality of Codeword Symbols
• Polynomial Codes Over Certain Finite Fields
• Algebraic Function Fields and Codes
• A Unified Construction of Space–Time Codes With Optimal Rate–Diversity Tradeoff
• Fundamentals of Error-Correcting Codes
• Error Detecting and Error Correcting Codes
• Sum-Rank BCH Codes and Cyclic-Skew-Cyclic Codes
• Constructing Partial MDS Codes from Reducible Algebraic Curves
• A Construction of Maximally Recoverable Codes With Order-Optimal Field Size
• Fundamental Properties of Sum-Rank-Metric Codes
• On Optimal Locally Repairable Codes With Multiple Disjoint Repair Sets
• 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
• Reliable and Secure Multishot Network Coding Using Linearized Reed-Solomon Codes
• Partial-MDS Codes and Their Application to RAID Type of Architectures
• Maximum distance<tex>q</tex>-nary codes
• Maximum-rank array codes and their application to crisscross error correction
• On additive MDS codes over small fields

This page was built for publication: A General Family of MSRD Codes and PMDS Codes with Smaller Field Sizes from Extended Moore Matrices