Optimal ternary cyclic codes with minimum distance four and five

From MaRDI portal
Publication:405959

DOI10.1016/J.FFA.2014.06.001zbMATH Open1354.94067arXiv1309.1218OpenAlexW2094825109MaRDI QIDQ405959FDOQ405959


Authors: Nian Li, Chunlei Li, Tor Helleseth, Cunsheng Ding, Xiaohu Tang Edit this on Wikidata


Publication date: 8 September 2014

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

Abstract: Cyclic codes are an important subclass of linear codes and have wide applications in data storage systems, communication systems and consumer electronics. In this paper, two families of optimal ternary cyclic codes are presented. The first family of cyclic codes has parameters [3m1,3m12m,4] and contains a class of conjectured cyclic codes and several new classes of optimal cyclic codes. The second family of cyclic codes has parameters [3m1,3m22m,5] and contains a number of classes of cyclic codes that are obtained from perfect nonlinear functions over fthreem, where m>1 and is a positive integer.


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




Recommendations




Cites Work


Cited In (26)





This page was built for publication: Optimal ternary cyclic codes with minimum distance four and five

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