Parameters of subfield complement codes over fields of characteristic 2

Let D=ΔM1+ηΔM2++ηn1ΔMnF2nmD=\Delta_{M_1}+\eta\Delta_{M_2}+\cdots+\eta^{n-1}\Delta_{M_n}\subset\mathbb{F}_{2^n}^m be as above, with the hypotheses stated in the source, and let CDc(2)C^{(2)}_{D^c} be the associated subfield complement code. The subfield complement parameters conjecture. The code CDc(2)C^{(2)}_{D^c} is an nmnm-dimensional, two-weight linear code over F2\mathbb{F}_2 with distance

2nm12j=1nMj1.2^{nm-1}-2^{\sum_{j=1}^n|M_j|-1}.

Moreover, it is a Griesmer code and is minimal if j=1nMjnm2\sum_{j=1}^n|M_j|\leq nm-2. The claim is based on computations for fields of orders 22, 44, 88, and 1616; no general proof or resolution is supplied.

Sources & referencesView supporting material

Primary source

Vidya Sagar and Ritumoni Sarma, “Linear codes using simplicial complexes”, arXiv:2204.08417 (2022).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.