A family of optimal ternary cyclic codes with minimum distance five and their duals (Q2130021)

Cyclic codes are a special subclass of linear codes which have wide applications in storage and communication systems and they have efficient encoding and decoding algorithms. Let \(\mathbb{F}_{3^m}^\ast=\langle\beta\rangle,\) define \(C_j =\{j \cdot 3t\pmod{3^m-1} : t = 0, 1, \ldots , l_j-1\},\) where \(l_j\) is the smallest integer satisfying \(j\cdot 3l_j\equiv j \pmod{3^m- 1}\) to be the cyclotomic coset modulo \(3^m-1\) containing \(j.\) If \(m_i(x)=\prod\limits_{j\in C_i}^{}(x-\beta^j),\) denote by \(\mathcal{C}(i_1,i_2,\ldots,i_t)\) the cyclic code with generator polynomial \(m_{i_1}(x)m_{i_2}(x)\cdots m_{i_t} (x).\) In this paper, a new family of cyclic codes \(\mathcal{C}(0,u,v)\) which are proven to be optimal ternary cyclic codes with minimum distance five are obtained from known perfect nonlinear functions over \(\mathbb{F}_{3^m}\). Moreover the weight distributions of their duals are found and given in tabular form.