5 problems

Let $m$ and $t$ be integers, and let $C$ be obtained by adding an overall parity check to the primitive BCH code of length $2^m-1$ and designed distance $2t-1$. Thus $C$ has length…

Let $C$ be a binary linear code, and let $\sigma$ be a permutation in its permutation automorphism group $\operatorname{PAut}(C)$. Let $E_\sigma(C)$ denote the associated $\sigma$-…

Assmus–Mattson nonexistence conjecture. Then

Antipodal code coefficient conjecture. One has

Generalized Hamming polynomial reconstruction conjecture. The Tutte polynomial satisfies