5 problems

Let $p$ be an odd prime. Let $F$ be the function defined by Eq. (10), with $t=m$, and let $b\geq 2$ satisfy $b\mid(p^m-1)$. Define … and let $C_{D_{F,H_b}}$ be the linear code defi…

Let $d(n,k)$ denote the largest minimum distance of a binary linear $[n,k]$ code, and let $d_{so}(n,k)$ denote the largest minimum distance of a binary self-orthogonal $[n,k]$ code…

Let $d(n,5)$ denote the maximum minimum distance of a binary linear $[n,5]$ code, and let $d_{\mathrm{so}}(n,5)$ denote the maximum minimum distance of a binary self-orthogonal…

Let $d(n,5)$ denote the largest minimum distance of a binary linear $[n,5]$ code, and let $\dso(n,5)$ denote the largest minimum distance of a binary self-orthogonal $[n,5]$ code.…

Let $[n,4]$ codes be binary linear codes of length $n$ and dimension $4$. A code is optimal if its minimum distance is $d(n,4)$, and it is self-orthogonal if it is orthogonal to it…