A Characterization of Classes of Linear Ternary Codes over the GaloisField GF(3)

Linear cyclic ternary codes defined over the Galois field GF(3) exhibit several advantages over their binary counterparts. For instance, they provide an extra option for each pulse resulting into a larger set of available codes at any given length. This paper presents a comprehensive study of classes of linear cyclic ternary codes of length 25 ≤ n ≤ 50. While binary codes have been extensively studied, the properties and applications of longer ternary codes remain less explored. This study address this gap by providing an in-depth characterization of these codes for the stated lengths. Using computational methods implemented in Magma software, a diverse set of linear cyclic ternary codes over GF(3) were generated and analyzed. The paper provides a multifaceted characterization framework that integrates algebraic, combinatorial, and geometric perspectives, offering a holistic understanding of these codes. This study contributes to the theoretical advancement of non-binary codes and their practical applications in error correction, cryptography, and communication systems.