Parameters of several families of binary duadic codes and their related codes
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.
- A probabilistic algorithm for computing minimum weights of large error-correcting codes
- Binary [n, (n + 1)/2] Cyclic Codes With Good Minimum Distances
- Cyclotomic Constructions of Cyclic Codes With Length Being the Product of Two Primes
- Cyclotomy and duadic codes of prime lengths
- Duadic Codes
- Five infinite families of binary cyclic codes and their related codes with good parameters
- Fundamentals of Error-Correcting Codes
- scientific article; zbMATH DE number 1284429 (Why is no real title available?)
- scientific article; zbMATH DE number 1339967 (Why is no real title available?)
- New quantum codes from CSS codes
- On Cyclic Codes of Composite Length and the Minimum Distance
- On Cyclic Codes of Composite Length and the Minimum Distance II
- On weights in duadic codes
- Self-orthogonal cyclic codes with good parameters
- Binary duadic codes and their related codes with a square-root-like lower bound
- Constructions of binary cyclic codes with minimum weights exceeding the square-root lower bound
- Three families of binary cyclic codes with good lower bounds
- Several infinite families of binary cyclic codes with square-root-like lower bounds
- A generalization of the Tang-Ding binary cyclic codes
- Several families of q-ary cyclic codes with length q^m -1
- Constructions of duadic codes with minimum weights exceeding the square-root lower bound
This page was built for publication: Parameters of several families of binary duadic codes and their related codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6146589)
