A general family of MSRD codes and PMDS codes with smaller field sizes from extended Moore matrices
From MaRDI portal
Publication:5099097
linearized Reed-Solomon codeslocally repairable codesMDS codesMoore matricesMRD codesMSRD codesPMDS codessum-rank metric
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Matrices over special rings (quaternions, finite fields, etc.) (15B33) Linear codes (general theory) (94B05) Geometric methods (including applications of algebraic geometry) applied to coding theory (94B27) Bounds on codes (94B65)
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 , meet a recent bound by Byrne et al.
Recommendations
Cites work
- A complete classification of partial MDS (maximally recoverable) codes with one global parity
- A construction of maximally recoverable codes
- A Construction of Maximally Recoverable Codes With Order-Optimal Field Size
- A general theory of Vandermonde matrices
- A Unified Construction of Space–Time Codes With Optimal Rate–Diversity Tradeoff
- Algebraic Function Fields and Codes
- Bilinear forms over a finite field, with applications to coding theory
- Codes With Local Regeneration and Erasure Correction
- Constructing Partial MDS Codes from Reducible Algebraic Curves
- Construction of Partial MDS and Sector-Disk Codes With Two Global Parity Symbols
- Constructions of Maximally Recoverable Local Reconstruction Codes via Function Fields
- Constructions of Partial MDS Codes Over Small Fields
- Error detecting and error correcting codes
- Explicit Maximally Recoverable Codes With Locality
- Fundamental Properties of Sum-Rank-Metric Codes
- Fundamentals of Error-Correcting Codes
- Group codes on certain algebraic curves with many rational points
- scientific article; zbMATH DE number 3882549 (Why is no real title available?)
- scientific article; zbMATH DE number 3577144 (Why is no real title available?)
- Matroidal structure of skew polynomial rings with application to network coding
- Maximally Recoverable LRCs: A Field Size Lower Bound and Constructions for Few Heavy Parities
- 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
- On Optimal Locally Repairable Codes With Multiple Disjoint Repair Sets
- On the asymptotic behaviour of some towers of function fields over finite fields
- On the Locality of Codeword Symbols
- Partial-MDS Codes and Their Application to RAID Type of Architectures
- Polynomial Codes Over Certain Finite Fields
- Random construction of partial MDS codes
- 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
- Sum-Rank BCH Codes and Cyclic-Skew-Cyclic Codes
- Theory of codes with maximum rank distance
- Theory of supports for linear codes endowed with the sum-rank metric
- Twisted linearized Reed-Solomon codes: a skew polynomial framework
- Universal and Dynamic Locally Repairable Codes With Maximal Recoverability via Sum-Rank Codes
- Vandermonde and Wronskian matrices over division rings
Cited in
(12)- A complete classification of partial MDS (maximally recoverable) codes with one global parity
- The geometry of one-weight codes in the sum-rank metric
- Random construction of partial MDS 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
- Doubly and triply extended MSRD codes
- New constructions of MSRD codes
- On MSR subspace families of lines
- Fast decoding of interleaved linearized Reed-Solomon codes and variants
- Linear codes in the folded Hamming distance and the quasi MDS property
- Multilayer crisscross error and erasure correction
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)
