Weight-enumerator conjecture for the Kassami APN design code

At least 6 years old · documented by

Let n≥5n\geq5 be odd. Let C2(KAn,1)\mathsf{C}_2(\mathbb{KA}_{n,1}) denote the binary linear code generated by the block characteristic vectors of KAn,1\mathbb{KA}_{n,1}. Kassami-code parameter conjecture. The code has parameters

[2n,2n+1,2n−1−2(n−1)/2][2^n,2n+1,2^{n-1}-2^{(n-1)/2}]

and weight enumerator 1+uz2n−1−2(n−1)/2+vz2n−1+uz2n−1+2(n−1)/2+z2n1+uz^{2^{n-1}-2^{(n-1)/2}}+vz^{2^{n-1}}+uz^{2^{n-1}+2^{(n-1)/2}}+z^{2^n}, where u=22n−1−2n−1u=2^{2n-1}-2^{n-1} and v=22n+2n−2v=2^{2n}+2^n-2. Its dual has parameters

[2n,2n−2n−1,6].[2^n,2^n-2n-1,6].

The source presents this as an unverified conjecture; no general resolution is supplied.

References

Primary source

Chunming Tang, “Infinite families of 3-designs from APN functions”, arXiv:1904.04071 (2019).

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.