2 problems

Let $A_q(n,d;k)$ denote the maximum size of a constant-dimension $k$-subspace code in $\mathbb{F}_q^n$ with minimum subspace distance at least $d$. Generalized vector space partiti…

Let $q$ be a prime power, and let $B_q(v_1,v_2,d;k)$ denote the maximum size of a constant-dimension code in a $v_1$-dimensional vector space whose codewords have dimension $k$, mi…