Linear MSRD codes with Various Matrix Sizes and Unrestricted Lengths
Hao Chen

TL;DR
This paper introduces a new construction method for linear maximum sum-rank distance (MSRD) codes over arbitrary fields, accommodating various matrix sizes and unrestricted lengths, thus broadening the applicability of such codes.
Contribution
The paper presents a novel construction of linear MSRD codes for arbitrary matrix sizes and lengths, satisfying specific size conditions, extending previous limited parameter cases.
Findings
Constructed MSRD codes for various matrix sizes
Codes achieve the Singleton bound in sum-rank metric
Applicable over any finite field ${f F}_q$
Abstract
A sum-rank-metric code attaining the Singleton bound is called maximum sum-rank distance (MSRD). MSRD codes have been constructed for some parameter cases. In this paper we construct a linear MSRD code over an arbitrary field with various matrix sizes satisfying for for any given minimum sum-rank distance.
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
TopicsAdvanced Wireless Network Optimization · Advanced MIMO Systems Optimization · Advanced Wireless Communication Techniques
