A new lower bound for the minimum distance of a cyclic code
From MaRDI portal
(Redirected from Publication:3671045)
Cited in
(18)- A symmetric Roos bound for linear codes
- Additive twisted codes: new distance bounds and infinite families of quantum codes
- On some bounds on the minimum distance of cyclic codes over finite fields
- Sum-rank product codes and bounds on the minimum distance
- Rank error-correcting pairs
- On the triple-error-correcting cyclic codes with zero set \(\{1, 2^i+1, 2^j+ 1\}\)
- Monomial codes seen as invariant subspaces
- Linear codes invariant under cyclic endomorphisms
- Quasi-twisted codes as invariant subspaces
- A commutative algebra approach to linear codes
- New bounds on the minimum distance of cyclic codes
- Four infinite families of ternary cyclic codes with a square-root-like lower bound
- A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes
- Constacyclic codes as invariant subspaces
- Power error locating pairs
- Roos bound for skew cyclic codes in Hamming and rank metric
- Bounds on the minimum distance of the duals of extended BCH codes over \(\mathbb{F}_ p\)
- Decoding up to Hartmann-Tzeng and Roos bounds for rank codes
This page was built for publication: A new lower bound for the minimum distance of a cyclic code
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3671045)
