Abstract
In this paper we prove that rank metric codes with special properties imply the existence of q-analogs of suitable designs. More precisely, we show that the minimum weight vectors of a [2d,d,d] dually almost MRD code C≤Fqm2d(2d≤m) which has no code words of rank weight d+1 form a q-Steiner system S(d−1,d,2d)q. This is the q-analog of a result in classical coding theory and it may be seen as a first step to prove a q-analog of the famous Assmus–Mattson Theorem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
