On a family of linear MRD codes with parameters $[8\times8,16,7]_q$
Marco Timpanella, Giovanni Zini

TL;DR
This paper investigates a specific family of 16-dimensional linear rank metric codes in 8x8 matrices over finite fields, identifying which are MRD for large odd q and showing their novelty compared to existing codes.
Contribution
It precisely characterizes MRD codes within a family derived from a polynomial, demonstrating their uniqueness among known MRD codes for large odd q.
Findings
Identifies exactly which codes in the family are MRD for large odd q.
Shows these MRD codes are not equivalent to previously known MRD codes.
Abstract
In this paper we consider a family of -dimensional -linear rank metric codes in , arising from the polynomial . Examples of MRD codes in have been provided by Csajb\'ok, Marino, Polverino and Zanella (2018). For any large enough odd , we determine exactly which codes in are MRD. We also show that the MRD codes in are not equivalent to any other MRD codes known so far.
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
TopicsCoding theory and cryptography · Cooperative Communication and Network Coding · Advanced Wireless Communication Techniques
