Journal of Applied Mathematics

The Weight Distributions of a Class of Cyclic Codes with Three Nonzeros over 𝔽 3

Xiaogang Liu and Yuan Luo

Full-text: Open access

Abstract

Cyclic codes have efficient encoding and decoding algorithms. The decoding error probability and the undetected error probability are usually bounded by or given from the weight distributions of the codes. Most researches are about the determination of the weight distributions of cyclic codes with few nonzeros, by using quadratic forms and exponential sums but limited to low moments. In this paper, we focus on the application of higher moments of the exponential sums to determine the weight distributions of a class of ternary cyclic codes with three nonzeros, combining with not only quadratic forms but also MacWilliams’ identities. Another application of this paper is to emphasize the computer algebra system Magma for the investigation of the higher moments. In the end, the result is verified by one example using Matlab.

Article information

Source
J. Appl. Math., Volume 2014 (2014), Article ID 686138, 11 pages.

Dates
First available in Project Euclid: 2 March 2015

Permanent link to this document
https://projecteuclid.org/euclid.jam/1425305887

Digital Object Identifier
doi:10.1155/2014/686138

Mathematical Reviews number (MathSciNet)
MR3232927

Citation

Liu, Xiaogang; Luo, Yuan. The Weight Distributions of a Class of Cyclic Codes with Three Nonzeros over 𝔽 3. J. Appl. Math. 2014 (2014), Article ID 686138, 11 pages. doi:10.1155/2014/686138. https://projecteuclid.org/euclid.jam/1425305887


Export citation

References

  • D. R. Anderson, “A new class of cyclic codes,” SIAM Journal on Applied Mathematics, vol. 16, pp. 181–197, 1968.
  • F. J. Macwilliams, “On binary cyclic codes which are also cyclic over ${GF}_{{2}^{s}}$,” SIAM Journal on Applied Mathematics, vol. 19, no. 1, pp. 75–95, 1970.
  • T. Kasami, “A decoding procedure for multiple-error-correcting cyclic codes,” IEEE Transactions on Information Theory, vol. 10, pp. 134–138, 1964.
  • V. Pless and W. C. Huffman, Handbook of Coding Theory, Elsevier, Amsterdam, The Netherlands, 1998.
  • S. G. S. Shiva and K. C. Fung, “Permutation decoding on certain triple error-correcting binary codes,” IEEE Transactions on Information Theory, vol. 18, no. 3, pp. 444–446, 1972.
  • S. G. S. Shiva, K. C. Fung, and H. S. Y. Tan, “On permutation decoding of binary cyclic double-error-correcting codes of certain lengths,” IEEE Transactions on Information Theory, vol. 16, pp. 641–643, 1970.
  • F. MacWilliams and J. Seery, “The weight distributions of some minimal cyclic codes,” IEEE Transactions on Information Theory, vol. 27, no. 6, pp. 796–806, 1981.
  • R. J. McEliece and J. Rumsey, “Euler products, cyclotomy, and coding,” Journal of Number Theory, vol. 4, pp. 302–311, 1972.
  • M. van der Vlugt, “Hasse-Davenport curves, Gauss sums, and weight distributions of irreducible cyclic codes,” Journal of Number Theory, vol. 55, no. 2, pp. 145–159, 1995.
  • C. Ding, “The weight distribution of some irreducible cyclic codes,” IEEE Transactions on Information Theory, vol. 55, no. 3, pp. 955–960, 2009.
  • C. Ding and J. Yang, “Hamming weights in irreducible cyclic codes,” Discrete Mathematics, vol. 313, no. 4, pp. 434–446, 2013.
  • R. W. Fitzgerald and J. L. Yucas, “Sums of Gauss sums and weights of irreducible codes,” Finite Fields and their Applications, vol. 11, no. 1, pp. 89–110, 2005.
  • R. J. McEliece, “Irreducible cyclic codes and Gauss sums,” in Combinatorics, Part 1: Theory of Designs, Finite Geometry and Coding Theory, vol. 55, pp. 179–196, Mathematica Centrum, Amsterdam, The Netherlands, 1974.
  • C. Ding, Y. Liu, C. Ma, and L. Zeng, “The weight distributions of the duals of cyclic codes with two zeros,” IEEE Transactions on Information Theory, vol. 57, no. 12, pp. 8000–8006, 2011.
  • K. Feng and J. Luo, “Weight distribution of some reducible cyclic codes,” Finite Fields and their Applications, vol. 14, no. 2, pp. 390–409, 2008.
  • J. Luo, Y. Tang, and H. Wang, “Cyclic codes and sequences: the generalized Kasami case,” IEEE Transactions on Information Theory, vol. 56, no. 5, pp. 2130–2142, 2010.
  • M. van der Vlugt, “Surfaces and the weight distribution of a family of codes,” IEEE Transactions on Information Theory, vol. 43, no. 4, pp. 1354–1360, 1997.
  • S. X. Li, S. H. Hu, T. Feng, and G. Ge, “The weight distribution of a class of cyclic codes related to Hermitian forms graphs,” IEEE Transactions on Information Theory, vol. 59, no. 5, pp. 3064–3067, 2013.
  • X. Liu and Y. Luo, “The weight distributions of some cyclic codes with three or four nonzeros over ${\mathbb{F}}_{3}$,” Designs, Codes and Cryptography, 2013.
  • M. Xiong, “The weight distributions of a class of cyclic codes II,” Designs, Codes and Cryptography, vol. 72, no. 3, pp. 511–528, 2014.
  • Z. Zhou, C. Ding, J. Luo, and A. Zhang, “A family of five-weight cyclic codes and their weight enumerators,” IEEE Transactions on Information Theory, vol. 59, no. 10, pp. 6674–6682, 2013.
  • A. Johansen and T. Helleseth, “A family of $m$-sequences with five-valued cross correlation,” IEEE Transactions on Information Theory, vol. 55, no. 2, pp. 880–887, 2009.
  • A. Johansen, T. Helleseth, and A. Kholosha, “Further results on $m$-sequences with five-valued cross correlation,” IEEE Transactions on Information Theory, vol. 55, no. 12, pp. 5792–5802, 2009.
  • N. Boston and G. McGuire, “The weight distributions of cyclic codes with two zeros and zeta functions,” Journal of Symbolic Computation, vol. 45, no. 7, pp. 723–733, 2010.
  • R. Lidl and H. Niederreiter, Finite Fields, Cambridge University Press, Cambridge, UK, 1997.
  • X. Liu and Y. Luo, “On the bounds and achievability about the ODPC of $\mathcal{G}\mathcal{R}\mathcal{M}$(2,m)$^{\ast\,\!}$ over prime field for increasing message length,” Designs, Codes and Cryptography, 2013.
  • Y. Chen and A. J. H. Vinck, “A lower bound on the optimum distance profiles of the second-order Reed-Muller codes,” IEEE Transactions on Information Theory, vol. 56, no. 9, pp. 4309–4320, 2010.
  • W. Bosma, J. Cannon, and C. Playoust, “The Magma algebra system. I. The user language,” Journal of Symbolic Computation, vol. 24, no. 3-4, pp. 235–265, 1997.
  • R. Hartshorne, Algebraic Geometry, GTM 52, Springer, New York, NY, USA, 1977.
  • F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, The Netherlands, 1988. \endinput