Constructions of Partial MDS Codes Over Small Fields
From MaRDI portal
Recommendations
- Near-MDS codes over some small fields
- On m-MDS codes over finite fields
- On additive MDS codes over small fields
- Construction of MDS self-dual codes over finite fields
- Random construction of partial MDS codes
- Constructing MDS Galois self-dual constacyclic codes over finite fields
- Constructions of MDS-convolutional codes
- Some new constructions of MDS self-dual codes over finite fields
- Sparse and Balanced MDS Codes Over Small Fields
- Constructing Partial MDS Codes from Reducible Algebraic Curves
Cited in
(16)- Near-MDS codes over some small fields
- Some optimal cyclic \(\mathbb{F}_q\)-linear \(\mathbb{F}_{q^t}\)-codes
- A construction of maximally recoverable codes
- Linear programming bounds for distributed storage codes
- Constructing Partial MDS Codes from Reducible Algebraic Curves
- A general family of MSRD codes and PMDS codes with smaller field sizes from extended Moore matrices
- Rank-metric codes and their applications
- Codes for Distributed Storage
- Codes in the sum-rank metric: fundamentals and applications
- Construction of systematic \((k+1,k)\) memory MDS sliding window codes over embedded fields
- On additive MDS codes over small fields
- Clay and product-matrix MSR codes with locality
- Locally maximal recoverable codes and LMR-LCD codes
- Easy repair via codes with simplex locality
- A new construction of maximally recoverable codes with hierarchical locality
- Locally maximal recoverable codes with unequal localities and LMR codes with hierarchical locality
This page was built for publication: Constructions of Partial MDS Codes Over Small Fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5224025)
