Abstract
Cyclic codes are an important class of linear codes and have been widely used in many areas such as consumer electronics, data storage and communication systems. Let C (1,e) denote the cyclic code with generator polynomial m α (x)m α e (x), where α is a primitive element of F 3m and m α i (x) denotes the minimal polynomial of α i over F 3 for 1 ≤ i ≤ 3m-1. In this paper, through some subtle manipulation on solving certain equations over finite fields, a conjecture proposed by Ding and Helleseth in 2013 about a class of optimal ternary cyclic codes C (1,e) for e = 2(1+3 h ) with parameters [3 m -1, 3 m -1-2m, 4] is settled, where m > 1 is an odd integer and 0 ≤ h ≤ m-1.

This publication has 18 references indexed in Scilit: