On the minimum distances of non-binary cyclic codes
Cyclic codes over \(\text{GF}(q)\) of length \(q^m-1\) are studied. The codes have generator polynomials \(g(x)\) which are products of two distinct minimal polynomials. Let \(\gamma\) be an element of order \(q^m-1\) and let \(g(x)\) be the product of the minimal polynomials of \(\gamma^i\) and \(\gamma^j\). Let \(d_{ij}\) be the minimum distance of this cyclic code. The authors first show that \(d_{i,j}=2\) if and only if \(\text{gcd}(i,j,q^m-1)>1\) or \(\text{gcd}(j-i,q-1)>1\). Further, if \(q=3\) and neither of these conditions hold then \(d_{i,j}=3\) or 4 and both these values occur. If \(q>3\) and neither of these conditions hold then \(d_{i,j}=3\). In the special case \(q=3\) and \(t=3^s+1\), then \(d_{1,t}=3\) if \(m/\text{gcd}(m,s)\) is even and \(d_{1,t}=4\) if \(m/\text{gcd}(m,s)\) is odd.
- On binary cyclic codes with minimum distance d=3.
- On the minimum distance of negacyclic codes with two zeros
- Double-error-correcting cyclic codes and absolutely irreducible polynomials over \(\text{GF}(2)\)
- On bases of BCH codes with designed distance 3 and their extensions
- A non-cyclic triple-error-correcting BCH-like code and some minimum distance results
- A new bound on the minimum distance of cyclic codes using small-minimum-distance cyclic codes
- A new class of distance-optimal binary cyclic codes and their duals
- Optimal \(p\)-ary cyclic codes with two zeros
- More on the minimum distance of cyclic codes
- Irreducible trinomials over finite fields
- scientific article; zbMATH DE number 1488178 (Why is no real title available?)
- On a (145, 32) binary cyclic code
- On a sequence of cyclic codes with minimum distance six
- scientific article; zbMATH DE number 2154140 (Why is no real title available?)
- scientific article; zbMATH DE number 1932292 (Why is no real title available?)
- scientific article; zbMATH DE number 910957 (Why is no real title available?)
- On the Minimal Distance of Binary Self-Dual Cyclic Codes
- Counting irreducible polynomials over GF(3) with first and third coefficients given
- Decoding Cyclic Codes up to a New Bound on the Minimum Distance
- Cyclic codes from some monomials and trinomials
- Several classes of optimal cyclic codes with three zeros
This page was built for publication: On the minimum distances of non-binary cyclic codes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1963168)
