New constructions of MSRD codes

DOI10.1007/S40314-024-02915-ZMaRDI QIDQ6616163zbMATH OpenFDO

Authors Umberto Martínez-Peñas

Publication date 8 October 2024

Published in Computational and Applied Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S40314-024-02915-Z

zbMATH Keywords

linearized Reed-Solomon codesmaximum sum-rank distance codesrank metricsum-rank metric

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Bounds on codes (94B65)

Cites work

• A Construction of Maximally Recoverable Codes With Order-Optimal Field Size
• A general family of MSRD codes and PMDS codes with smaller field sizes from extended Moore matrices
• A Unified Construction of Space–Time Codes With Optimal Rate–Diversity Tradeoff
• Codes in the sum-rank metric: fundamentals and applications
• Doubly and triply extended MSRD codes
• Fundamental Properties of Sum-Rank-Metric Codes
• Improved Maximally Recoverable LRCs Using Skew Polynomials
• New explicit good linear sum-rank-metric codes
• On subspace designs
• Optimal Anticodes, MSRD Codes, and Generalized Weights in the Sum-Rank Metric
• 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
• Space–Time Codes From Sum-Rank Codes
• The geometry of one-weight codes in the sum-rank metric
• 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

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)