A class of optimal ternary cyclic codes and their duals

From MaRDI portal
Publication:897332

DOI10.1016/J.FFA.2015.10.004zbMATH Open1354.94066arXiv1510.05048OpenAlexW2137451425MaRDI QIDQ897332FDOQ897332


Authors: Nian Li, Zhengchun Zhou, Cui Ling Fan Edit this on Wikidata


Publication date: 17 December 2015

Published in: Finite Fields and their Applications (Search for Journal in Brave)

Abstract: Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. Let m=2ell+1 for an integer ellgeq1 and pi be a generator of gf(3m)*. In this paper, a class of cyclic codes C(u,v) over gf(3) with two nonzeros piu and piv is studied, where u=(3m+1)/2, and v=2cdot3ell+1 is the ternary Welch-type exponent. Based on a result on the non-existence of solutions to certain equation over gf(3m), the cyclic code C(u,v) is shown to have minimal distance four, which is the best minimal distance for any linear code over gf(3) with length 3m1 and dimension 3m12m according to the Sphere Packing bound. The duals of this class of cyclic codes are also studied.


Full work available at URL: https://arxiv.org/abs/1510.05048




Recommendations




Cites Work


Cited In (25)





This page was built for publication: A class of optimal ternary cyclic codes and their duals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897332)