Three families of binary cyclic codes with good lower bounds

Via binary BCH codes, the authors construct an infinite family of binary cyclic codes with parameters \([2^m-1, k\geq 2^{m-1}-1, d \geq \lfloor \frac{2^m-1}{m}\rfloor+2]\) that have square-root-like lower bound. It's shown that this family contains distance-optimal codes and codes with best-known parameters. Choosing an odd \(m\geq 5,\) a family of binary duadic codes with parameters \([2^m-1, 2^{m-1}-1, d \geq 2^{(m-1)/2}+3]\) is presented.\N\NTwo families of binary cyclic codes with a square-root-like lower bound are also constructed; the first family is binary cyclic codes constructed from 2-weight. The second family arises from binary cyclic codes constructed from dual-containing codes. The parameters of these several new families of binary cyclic codes and their duals are studied. Some examples are shown; when \(m = 5,\) \(n=31\) the code \(\mathcal{C}_{[5,4,\{0,1\}]}\) has parameters \([31, 21, 5]\) and is a distance-optimal code, as is the dual code \(\mathcal{C}^{\bot}_{[5,4,\{2,3\}]}\) with parameters \([31, 20, 6],\) among others.

Cites work

Cited in

(2)

This page was built for publication: Three families of binary cyclic codes with good lower bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6981188)