New constructions of MSRD codes
From MaRDI portal
Publication:6616163
DOI10.1007/S40314-024-02915-ZMaRDI QIDQ6616163
Publication date: 8 October 2024
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
Could not fetch data.
Cites Work
- Theory of codes with maximum rank distance
- Skew and linearized Reed-Solomon codes and maximum sum rank distance codes over any division ring
- The geometry of one-weight codes in the sum-rank metric
- Twisted linearized Reed-Solomon codes: a skew polynomial framework
- Theory of supports for linear codes endowed with the sum-rank metric
- A Unified Construction of Space–Time Codes With Optimal Rate–Diversity Tradeoff
- A Construction of Maximally Recoverable Codes With Order-Optimal Field Size
- Fundamental Properties of Sum-Rank-Metric Codes
- Space–Time Codes From Sum-Rank Codes
- Optimal Anticodes, MSRD Codes, and Generalized Weights in the Sum-Rank Metric
- A General Family of MSRD Codes and PMDS Codes with Smaller Field Sizes from Extended Moore Matrices
- Universal and Dynamic Locally Repairable Codes With Maximal Recoverability via Sum-Rank Codes
- Reliable and Secure Multishot Network Coding Using Linearized Reed-Solomon Codes
- Codes in the Sum-Rank Metric: Fundamentals and Applications
- Doubly and triply extended MSRD codes
- Improved Maximally Recoverable LRCs Using Skew Polynomials
- On subspace designs
- New explicit good linear sum-rank-metric codes
This page was built for publication: New constructions of MSRD codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6616163)