Conjecture on the parameters and weight distribution of codes from almost bent exponents

Let n=2m+1n=2m+1, let ee be one of the almost bent exponents listed in the source's table, and choose tt with gcd(t,n)=1\gcd(t,n)=1. Define

f(x)=(x2t+x)ef(x)=(x^{2^t}+x)^e

and let Cf\mathcal{C}_f be the associated linear code.

Parameter and weight-distribution conjecture. The parameters of Cf\mathcal{C}_f should be the same as those of the code in the cited theorem, namely the theorem's parameters for the corresponding construction; moreover, the weight distribution of Cf\mathcal{C}_f should be determined.

This conjecture is motivated by experimental results and extends the observed code-parameter phenomenon to the listed almost bent exponents. The supplied text does not include the referenced table or theorem, so the exact parameter tuple and the claimed weight distribution remain to be determined.

Sources & referencesView supporting material

Primary source

Kangquan Li, Chunlei Li, Tor Helleseth and Longjiang Qu, “Binary linear codes with few weights from two-to-one functions”, arXiv:2006.12395 (2020).

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.