Abstract

In this paper, we first introduce generalized cyclotomic classes of order 4 and 8 and then present a special class of cyclic codes with length pm. We also obtain lower bound on the minimum odd weight of these codes.

References

[1] Apostol T. M., Introduction to Analytic Number Theory, Springer-Verlag, New York, 1976.
[2] Bakshi G. K. and Raka M., Minimal cyclic codes of length, Finite Fields and Their Applications, 9, 432-448, 2003.
[3] Baumert L. D., Cyclic Difference Sets, Lecture Notes in Mathematics, Vol. 182, Springer-Verlag, New York, 1971.
[4] Betti E. and Sala M., A new bound for the minimum distance of a cyclic code from its defining set, IEEE Transactions on Information Theory, 52(8), 3700-3706, 2006.
[5] Brouwer A. E., Bounds on the size of linear codes, in Handbook of Coding Theory, V. Pless and W. C. Huffman, Eds. Amsterdam, the Netherlands, Elsevier, 1998.
[6] Cusik T., Ding C. and Renvall A., Stream Ciphers and Number Theory, North-Holland Mathematical Lib., North-Holland, 2003.
[7] Ding C., Binary cyclotomic generators, in Fast Software Encryption (B. Preneel, Ed.), Lecture Notes in Computer Science, 1008, 29-60, 1995.
[8] Ding C., Cyclic codes from cyclotomic sequence of order four, Finite Fields and Their Applications, 23, 8-34, 2012.
[9] Ding C., Cyclic codes from the two-prime sequences, IEEE Transactions on Information Theory, 58(6), 3881-3891, 2012.
[10] Ding C., Cyclotomic constructions of cyclic codes with length being the product of two primes, IEEE Transactions on Information Theory 58(4), 2231-2236, 2012.

[11] Ding C., Du X., and Zhou Z., The bose and minimum distance of a class of BCH codes, IEEE Transactions on Information Theory, 61(5), 2351-2356, 2015.

[12] Ding C. and Helleseth, T., Generalized cyclotomic codes of length 𝑝1 𝑒1𝑝2 𝑒2 ⋯ 𝑝𝑡 𝑒𝑡 , IEEE Transactions on Information Theory, 45(2), 467- 474, 1999.

[13] Ding C. and Helleseth T., New generalized cyclotomy and its applications, Finite Fields and Their Applications, 4(2), 140-166, 1998.

[14] Ding C., Pie D. and Salomaa A., Chinese Remainder Theorem, Applications in Computing, Coding, Cryptography, World Scientific, Singapore, 1996, chs. 2 and 6.

[15] Eupen M. and Lint J. van, On the minimum distance of ternary cyclic codes, IEEE Transactions on Information Theory 39(2), 409-416, 1993.

[16] Gauss C. F., Disquisitions Arithmeticae, Leipzig, Germany, 1801, English translation, New Haven, CT: Yale Univ. Press, 1966, reprinted, Berlin, Heidelberg and New York, Springer-Verlag, 1986.

[17] Kewat P. K. and Kumari Preeti, Cyclic codes from the second class two-prime whiteman's generalized cyclotomic sequence with order 6, Cryptography and Communications, 9(4), 475-499, 2017.

[18] Leon J. S., A probabilistic algorithm for computing minimum weight of large error-correcting codes, IEEE Transactions on Information Theory, 34, 1354-1359, 1998.

[19] Leon J. S., Masley J. M. and Pless V., Duadic codes, IEEE Transactions on Information Theory, 30, 709-714, 1984.

[20] Lidl R. and Niederreiter H., Finite fields, Cambridge Univ. Press, 1997.

[21] Lint J. van and Wilson R., On the minimum distance of cyclic codes, IEEE Transactions on Information Theory 32(1), 23-40, 1986.

[22] MacWilliams F.J., Cyclotomic numbers, coding theory and orthogonal polynomials, Discrete Math., 3, 133-151, 1972.

[23] Macwilliams F. and Sloane N., The theory of error correcting codes, North-Holland Mathematical Lib., North-Holland, 1997.

[24] McEliece R. J. and Rumsey H., Euler product, cyclotomy and coding, Journal of Number Theory, 4, 302-311, 1972.

[25] Pankaj and Pruthi M., Cyclic codes from generalized cyclotomic sequences of order 8, Journal of Rajasthan Academy of Physical Sciences, 15(3), 155-182, 2016.

[26] Pankaj and Pruthi M., Cyclic codes from generalized cyclotomic sequences of order 2 𝑟 , 𝑟 ≥ 2, Journal of Information and Optimization Sciences, 38(3-4), 621-646, 2017.

[27] Pankaj and Pruthi M., Cyclic codes from generalized cyclotomic sequences of order 2𝑙, 𝑙 ≥ 2, The Journal of the Indian Academy of Mathematics, 38(2), 183-209, 2016.

[28] Pless V., Q-codes, Journal of Combinatorial Theory, 43(2), 258-276. 1986. International Journal of Mathematics Trends and Technology (IJMTT) – Volume 53 Issue 2 January 2018 ISSN: 2231-5373 http://www.ijmttjournal.org Page 171

[29] Pless V. and Huffman W. C., An introduction to algebraic codes, in Handbook of Coding Theory, V. Pless and W. C. Huffman, Eds. Amsterdam, the Netherlands, Elsevier, 1998.

[30] Pless V., Masley J. M. and Leon J. S., On weights in duadic codes, Journal of Combinatorial Theory, 44(1), 6-21, 1987.

[31] Pruthi M. and Arora S. K., Minimal Codes of Length 2𝑝 𝑛 Finite Fields and Their Applications 5, 177-187, 1999.

[32] Pruthi M. and Arora S. K., Minimal Codes of Prime-Power Length, Finite Fields and Their Applications 3, 99-113, 1997.

[33] Pruthi M. and Pankaj, The minimum Hamming distances of the irreducible cyclic codes of length 𝑙1 𝑚1 𝑙2 𝑚2 … 𝑙𝑟 𝑚𝑟 , Journal of Discrete Mathematical Sciences and Cryptography, 19(5-6), 965–995, 2016.

[34] Storer T., Cyclotomy and difference sets, Markham, Chicago, 1967.

[35] Sun Y., Yan T. and Li H., Cyclic codes from the two-prime whiteman's generalized cyclotomic sequences with order 4, CoRR arxiv:1303.6378, 2013. [36] Whiteman A. L., A family of difference sets, Illionois J. Math 6, 107-121, 1962.

[37] Yan T., Lui Y., Sun Y., Cyclic codes from generalized cyclotomic sequences of order 6, Advances in Mathematics of Communications, 10(4), 707-723, 2016.