Citation: | LI Lanqiang, ZHU Shixin, LIU Li, “Three Classes of Optimal Ternary Cyclic Codes and the Weight Distributions of Their Duals,” Chinese Journal of Electronics, vol. 28, no. 4, pp. 674-681, 2019, doi: 10.1049/cje.2019.04.001 |
H.Q. Dinh, “On the linear odering of some classess of negacyclic and cyclic codes and their distance distributions”, Finite Fields and Their Applications, Vol.14, pp.22–40, 2008.
|
C. Carlet, C. Ding and J. Yuan, “Linear codes from highly nonlinear functions and their secret sharing schemes”, IEEE Transactions on Information Theory, Vol.51, No.6, pp.2089–2102, 2005.
|
M. Shi, D. Huang and P. Sole, “Optimal Ternary Cubic TwoWeight Codes”, Chinese Journal of Electronics, Vol.27, No.4, pp.734–738, 2018.
|
C. Fan, N. Li and Z. Zhou, “A class of optimal ternary cyclic codes and their duals”, Finite Fields and Their Applications, Vol.37, pp.193–202, 2016.
|
C. Ding, Y. Yang and X. Tang, “Optimal sets of frequency hopping sequences from linear cyclic codes”, IEEE Transactions on Information Theory, Vol.56, No.7, pp.3605–3612, 2010.
|
C. Ding and S. Ling, “A q-polynomial approach to cyclic codes”, Finite Fields and Their Applications, Vol.20, pp.1–14, 2013.
|
Y. Jia, S. Ling and C. Xing, “On self-dual cyclic codes over finite fields”, IEEE Transactions on Information Theory, Vol.57, No.4, pp.2243–2251, 2011.
|
C. Ding, “Cyclic codes from some monomials and trinomials”, SIAM Journal on Discrete Mathematics, Vol.27, No.4, pp.1977–1994, 2013.
|
C. Li, Q. Yue and F. Li, “Weight distributions of cyclic codes with respect to pairwise coprime order elements”, Finite Fields and Their Applications, Vol.28, pp.94–114, 2014.
|
C. Li, N. Li, T. Helleseth and C. Ding, “The weight distributions of several classes of cyclic codes from APN monomials”, IEEE Transactions on Information Theory, Vol.60, No.8, pp.4710–4721, 2014.
|
T. Feng, “On cyclic codes of length 22r-1 with two zeros whose dual codes have three weights”, Designs Codes and Cryptography, Vol.62, No.3, pp.253–258, 2012.
|
B. Schmidt and C. White, “All two-weight irreducible cyclic codes”, Finite Fields and Their Applications, Vol.8, pp.1–17, 2012.
|
J. Yang, M. Xiong, C. Ding and J. Luo, “Weight distribution of a class of cyclic codes with arbitrary number of zeros”, IEEE Transactions on Information Theory, Vol.59, No.9, pp.5985–5993, 2013.
|
J. Yuan, C. Carlet and C. Ding, “The weight distribution of a class of linear codes from perfect nonlinear functions”, IEEE Transactions on Information Theory, Vol.52, No.2, pp.712–717, 2006.
|
D. Zheng, X. Wang, H. Hu and X. Zeng, “The weight distributions of two classes of p-ary cyclic codes”, Finite Fields and Their Applications, Vol.29, pp.202–242, 2014.
|
Z. Zhou and C. Ding, “A class of three-weight cyclic codes”, Finite Fields and Their Applications, Vol.25, pp.79–93, 2014.
|
Z. Zhou and C. Ding, “Seven classes of three-weight cyclic codes”, IEEE Transactions on Communications, Vol.61, No.10, pp.4120–4126, 2013.
|
S. Yang, Z. Yao and C. Zhao, “The weight distributions of two classes of p-ary cyclic codes with few weights”, Finite Fields and Their Applications, Vol.44, pp.76–91, 2017.
|
Q. Dai and C. Li, “Weight distributions of two classes of linear codes from perfect nonlinear functions”, Chinese Journal of Electronics, Vol.18, No.3, pp.465–470, 2009.
|
C. Li, S. Ling and L. Qu, “On the covering structures of two classes of linear codes from perfect nonlinear functions”, IEEE Transactions on Information Theory, Vol.55, No.1, pp.70–82, 2008.
|
X. Liu, M. Harrison and Y. Luo, “A note on the five valued conjectures of Johansen, Helleseth and Kholosha and zeta functions”, IEEE Communication Letters, Vol.18, No.9, pp.1483–1486, 2014.
|
C. Ding and T. Helleseth, “Optimal ternary cyclic codes from monomials”, IEEE Transactions on Information Theory, Vol.59, No.9, pp.5898–5904, 2013.
|
N. Li, C. Li, T. Helleseth, C. Ding and X.H. Tang, “Optimal ternary cyclic codes with minimum distance four and five”, Finite Fields and Their Applications, Vol.30, pp.100–120, 2014.
|
N. Li, Z. Zhou and T. Helleseth. “On a conjecture about a class of optimal ternary cyclic codes”, IEEE 2015 Seventh International Workshop on Signal Design and its Applications in Communications, Bengaluru, India, pp.62–65, 2015.
|
L. Wang and G. Wu, “Several classes of optimal ternary cyclic codes with minimal distance four”, Finite Fields and Their Applications, Vol.40, pp.126–137, 2016.
|
S. El Ronayheb, C. Georgbiades, E. Soljanin and A. Sprintson, “Bounds on codes based on graph theory”, Proc. IEEE International Symposium on Information Theory, Nice, France, pp.1876–1879, 2007.
|
R. Lidl and H. Niederreiter,Finite Fields, Cambridge University Press, New York, USA, pp.278–289, 1977.
|
P. Delsarte, “On subfield subcodes of modified Reed-Solomon codes”, IEEE Transactions on Information Theory, Vol.21, No.5, pp.575–576, 1975.
|