Author(s)

Wenwei Qiu

School of Mathematics and Information, China West Normal University, Nanchong, China.

As a branch of applied mathematics, coding theory plays an important role. Among them, cyclic codes have attracted much attention because of their good algebraic structure and easy analysis performance. In this paper, we will study one class of cyclic codes over F₃. Given the length and dimension, we show that it is optimal by proving its minimum distance is equal to 4, according to the Sphere Packing bound.

sphere packing bound, minimal distance, Cyclic code

Qiu, W. (2023) A Class of New Optimal Ternary Cyclic Codes over F_3^m with Minimum Distance 4. Applied Mathematics, 14, 764-772. doi: 10.4236/am.2023.1411046.