New Explicit Good Linear Sum-Rank-Metric Codes
Hao Chen

TL;DR
This paper introduces three explicit constructions of linear sum-rank-metric codes, achieving near-optimal parameters and including a new MSRD code over arbitrary finite fields with flexible matrix sizes.
Contribution
The paper presents three simple, explicit constructions of linear sum-rank-metric codes, including a novel MSRD code applicable over any finite field with flexible parameters.
Findings
Constructed larger linear sum-rank-metric codes with the same minimum distance.
Developed better codes over small fields with small block sizes.
Created a flexible MSRD code over arbitrary finite fields.
Abstract
Sum-rank-metric codes have wide applications in universal error correction, multishot network coding, space-time coding and the construction of partial-MDS codes for repair in distributed storage. Fundamental properties of sum-rank-metric codes have been studied and some explicit or probabilistic constructions of good sum-rank-metric codes have been proposed. In this paper we give three simple constructions of explicit linear sum-rank-metric codes. In finite length regime, numerous larger linear sum-rank-metric codes with the same minimum sum-rank distances as the previous constructed codes can be derived from our constructions. For example several better linear sum-rank-metric codes over with small block sizes and the matrix size are constructed for by applying our construction to the presently known best linear codes. Asymptotically our constructed…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCooperative Communication and Network Coding · Advanced Data Storage Technologies · Error Correcting Code Techniques
