Two classes of new optimal ternary cyclic codes (Q6112290): Difference between revisions

Cyclic codes are important class of error-correcting code, and are defined as codes for which if \((c_0,\ldots,c_{n-1})\in C\) it follows that \((c_{n-1},c_0,\ldots,c_{n-2})\in C.\) This type of codes is easily described as principal ideals \(((g(x))\) of the ring \(\mathbb{F}_q[x]/(x^n-1).\) This work achieves progress in finding two new classes of ternary cyclic codes by using monomials \(x^2\) and \(xv\) for some suitable \(v.\) The first class: for \(m,k\in\mathbb{N}\) with odd \(m\) and \(\gcd(m,k)=\gcd(3^k-2, 3^m-1)=1\) it is shown that \(C_{(2,v)}\) is an optimal ternary cyclic code with parameters \([3^m-1,3^m-1-2m,4]\) for \(v=\frac{3^m-1}{2}+2(3^k-1).\) The second class of codes are \(C_{(2,v)}\) with parameters \([3^m-1,3^m-1-2m,4]\) for \(v=\frac{3^m-1}{2}+2(3^k-1).\) For this class, optimality is proven and the code's dual is shown to be three-weight \([3^m-1,2m,2(3^{m-1}-3^{\frac{m-1}{2}})]\) cyclic ternary code for \(v=\frac{3^m-1}{2}+2(3^k+1).\) The weight distribution of the dual is found. The novelty of the codes presented in this work is thoroughly discussed by providing tables of known optimal ternary \(C_{1,e}\) codes with appropriate sources.