← All problems

Conjecture on non-full-weight cyclic codes over F3\mathbb F_3

Less than 1 year old · traced to

Let n>3n>3 be a prime, and let ord⁡n(3)\operatorname{ord}_n(3) denote the multiplicative order of 33 modulo nn. Set

r=n−1ord⁡n(3).r=\frac{n-1}{\operatorname{ord}_n(3)}.

Let N(n,3)\mathcal N(n,3) denote the family of cyclic codes over F3\mathbb F_3 containing no full-weight codeword. The cyclic-code counting conjecture. If ord⁡n(3)\operatorname{ord}_n(3) is odd, then

∣N(n,3)∣=∑j=0r2(rj).|\mathcal N(n,3)|=\sum_{j=0}^{\frac r2}\binom{r}{j}.

The formula refines a lower bound for ∣N(n,3)∣|\mathcal N(n,3)|; the case n=13n=13 gives 1111 cyclic codes, while the conjecture remains unproved in the stated generality.

References
  1. Yangcheng Li and Pingzhi Yuan, “Cyclic Codes and Cyclically Covering Subspaces over Finite Fields”, arXiv:2607.02239 (2026).

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.