On weights in duadic abelian codes

In this note, we prove that if C is a duadic binary abelian code with splitting μ=μ−1 and the minimum odd weight of C satisfies d2−d+1≠n, then d(d−1)⩾n+11. We show by an example that this bound is sharp. A series of open problems on this subject are proposed.