Parameters of several families of binary duadic codes and their related codes (Q6146589)

For \(i\in\mathbb{Z}, 0\leq i\leq 2^m-1,\) let \(i = i_{m-1}2^{m-1} + i_{m-2}2^{m-2}+\cdots+i_1 2 + i_0\) be the 2-adic expansion of \(i,\) where \(i_j\in \{0, 1\},\) \(0\leq j\leq m-1.\) Define \(w_2(i)=\sum\limits_{j=0}^{m-1}{i_j}.\) Let \(r\geq 2\) be a positive integer and let \(n = 2^m-1\) for an integer \(m \geq 3.\) Let \(S\) be any proper subset of \(\mathbb{Z}_r.\) Define \(T[r,m,S] = \{1 \leq i \leq n-1 : w_2(i)\ \text{mod}\ r\in S\}.\) For a primitive element of \(\alpha\in\mathbb{F}_{2^m},\) let \(C_{[r,m,S]}\) denote the binary cyclic code of length \(n\) with generator polynomial \(g_{[t,m,S]}=\prod\limits_{i\in T_{[r,m,S]}}{x-\alpha^i}.\) For even \(r\geq 2,\) the code \(C_{[r,m,S]}\) could be duadic for certain odd \(m.\) Binary duadic codes are an interesting subclass of cyclic codes since they have large dimensions, and their minimum distances may have a square-root bound. This paper presents several families of binary duadic codes of length \(2^m-1\) and develops some lower bounds on their minimum distances by using the BCH bound on cyclic codes, which partially solves one of the open cases when \(r=6.\) In each of the three cases studied: \(m\equiv 1 \pmod{6},\) \(m\equiv 3 \pmod{6},\) and \(m\equiv 5 \pmod{6},\) a pair of odd-like duadic codes is constructed. The main goal is to investigate the parameters of the binary duadic codes \(C[6,m,S]\) and \(C[6,m,\overline{S}]\) except \(S = \{0, 2, 4\}\) and their dual and extended codes. The authors show that the lower bounds on their minimum distances are close to the square root bound. Moreover, the parameters of the dual and extended codes of these binary duadic codes are explicitly formulated.