On a conjecture about a class of optimal ternary cyclic codes
Authors:
- 1 September 2015
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 62-65
Abstract
Cyclic codes are an important class of linear codes and have been widely used in many areas such as consumer electronics, data storage and communication systems. Let C (1,e) denote the cyclic code with generator polynomial m α (x)m α e (x), where α is a primitive element of F 3m and m α i (x) denotes the minimal polynomial of α i over F 3 for 1 ≤ i ≤ 3m-1. In this paper, through some subtle manipulation on solving certain equations over finite fields, a conjecture proposed by Ding and Helleseth in 2013 about a class of optimal ternary cyclic codes C (1,e) for e = 2(1+3 h ) with parameters [3 m -1, 3 m -1-2m, 4] is settled, where m > 1 is an odd integer and 0 ≤ h ≤ m-1.Keywords
This publication has 18 references indexed in Scilit:
- Optimal ternary cyclic codes with minimum distance four and fiveFinite Fields and Their Applications, 2014
- A Note on the Five Valued Conjectures of Johansen, Helleseth and Kholosha and Zeta FunctionsIEEE Communications Letters, 2014
- A q-polynomial approach to cyclic codesFinite Fields and Their Applications, 2013
- Weil sums of binomials, three-level cross-correlation, and a conjecture of HellesethJournal of Combinatorial Theory, Series A, 2012
- A triple-error-correcting cyclic code from the Gold and Kasami–Welch APN power functionsFinite Fields and Their Applications, 2012
- The weight distribution of a class of p-ary cyclic codesFinite Fields and Their Applications, 2010
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing SchemesIEEE Transactions on Information Theory, 2005
- Quantum codes from cyclic codes over GF(4/sup m/)IEEE Transactions on Information Theory, 2001
- On decoding BCH codesIEEE Transactions on Information Theory, 1965
- Cyclic decoding procedures for Bose- Chaudhuri-Hocquenghem codesIEEE Transactions on Information Theory, 1964