A general family of MSRD codes and PMDS codes with smaller field sizes from extended Moore matrices

DOI10.1137/20M1386001zbMATH Open1503.94060arXiv2011.14109OpenAlexW4291999168WikidataQ114074120 ScholiaQ114074120MaRDI QIDQ5099097FDOQ5099097

Authors: Umberto Martínez-Peñas 

Publication date: 31 August 2022

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

Abstract: We construct six new explicit families of linear maximum sum-rank distance (MSRD) codes, each of which has the smallest field sizes among all known MSRD codes for some parameter regime. Using them and a previous result of the author, we provide two new explicit families of linear partial MDS (PMDS) codes with smaller field sizes than previous PMDS codes for some parameter regimes. Our approach is to characterize evaluation points that turn extended Moore matrices into the parity-check matrix of a linear MSRD code. We then produce such sequences from codes with good Hamming-metric parameters. The six new families of linear MSRD codes with smaller field sizes are obtained using MDS codes, Hamming codes, BCH codes and three Algebraic-Geometry codes. The MSRD codes based on Hamming codes, of minimum sum-rank distance $3$, meet a recent bound by Byrne et al.

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

Recommendations

• A new family of linear maximum rank distance codes
• A new family of MRD-codes
• scientific article; zbMATH DE number 2154122
• Extending two families of maximum rank distance codes
• MRD codes: constructions and connections

zbMATH Keywords

locally repairable codesMDS codesMRD codesPMDS codessum-rank metricMoore matricesMSRD codeslinearized Reed-Solomon codes

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (9)

• Doubly and triply extended MSRD codes
• A complete classification of partial MDS (maximally recoverable) codes with one global parity
• Random construction of partial MDS codes
• New constructions of MSRD codes
• A class of almost MDS codes
• Zeros with multiplicity, Hasse derivatives and linear factors of general skew polynomials
• Codes in the sum-rank metric: fundamentals and applications
• On MSR subspace families of lines
• The geometry of one-weight codes in the sum-rank metric

This page was built for publication: A general family of MSRD codes and PMDS codes with smaller field sizes from extended Moore matrices

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