This is a small report on a failed project — obtaining semidefinite programming bounds on constant dimension network codes. But let us start with some context … A network code consists of a set of subspaces in [latex]\mathbb{F}_q^n[/latex]. It is a code, so we want to maximize the distance between subspaces (or increase the code’s […]