1 problem

Let $n,d\in\mathbb N$ satisfy $1<d<n$, and let $\mathbb F$ be a finite field. An MRD code is a maximum rank-distance code. Puncturing-inclusion conjecture. There exists an…