References
- Apostol T. M., Introduction to Analytic Number Theory, Springer-Verlag, New York, 1976.
- Bakshi G. K. and Raka M., Minimal cyclic codes of length pnq Finite Fields and Their Applications 9, 432-448, 2003. doi: 10.1016/S1071-5797(03)00023-6
- Baumert L. D., Cyclic Difference Sets, Lecture Notes in Mathematics, Vol. 182, Springer-Verlag, New York, 1971.
- 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. doi: 10.1109/TIT.2006.876240
- 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.
- Cusik T., Ding C. and Renvall A., Stream Ciphers and Number Theory, North-Holland Mathematical Lib., North-Holland, 2003.
- Ding C., Binary cyclotomic generators, in Fast Software Encryption (B. Preneel, Ed.), Lecture Notes in Computer Science, 1008, 29-60, 1995. doi: 10.1007/3-540-60590-8_4
- Ding C., Cyclic codes from cyclotomic sequence of order four, Finite Fields and Their Applications, 23, 8-34, 2012. doi: 10.1016/j.ffa.2013.03.006
- Ding C., Cyclic codes from the two-prime sequences, IEEE Transactions on Information Theory, 58(6), 3881-3891, 2012. doi: 10.1109/TIT.2012.2189549
- 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. doi: 10.1109/TIT.2011.2176915
- 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. doi: 10.1109/TIT.2015.2409838
- Ding C. and Helleseth, T., Generalized cyclotomic codes of length , IEEE Transactions on Information Theory, 45(2), 467-474, 1999. doi: 10.1109/18.748996
- Ding C. and Helleseth T., New generalized cyclotomy and its applications, Finite Fields and Their Applications, 4(2), 140-166, 1998. doi: 10.1006/ffta.1998.0207
- Ding C., Pie D. and Salomaa A., Chinese Remainder Theorem, Applications in Computing, Coding, Cryptography, World Scientific, Singapore, 1996, chs. 2 and 6.
- Eupen M. and Lint J. van, On the minimum distance of ternary cyclic codes, IEEE Transactions on Information Theory 39(2), 409-416, 1993. doi: 10.1109/18.212272
- 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.
- 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. doi: 10.1007/s12095-016-0191-8
- Leon J. S., A probabilistic algorithm for computing minimum weight of large error-correcting codes, IEEE Transactions on Information Theory, 34, 1354-1359, 1998. doi: 10.1109/18.21270
- Leon J. S., Masley J. M. and Pless V., Duadic codes, IEEE Transactions on Information Theory, 30, 709-714, 1984. doi: 10.1109/TIT.1984.1056944
- Lidl R. and Niederreiter H., Finite fields, Cambridge Univ. Press, 1997.
- Lint J. van and Wilson R., On the minimum distance of cyclic codes, IEEE Transactions on Information Theory 32(1), 23-40, 1986. doi: 10.1109/TIT.1986.1057134
- MacWilliams F.J., Cyclotomic numbers, coding theory and orthogonal polynomials, Discrete Math., 3, 133-151, 1972. doi: 10.1016/0012-365X(72)90029-5
- Macwilliams F. and Sloane N., The theory of error correcting codes, North-Holland Mathematical Lib., North-Holland, 1997.
- McEliece R. J. and Rumsey H., Euler product, cyclotomy and coding, Journal of Number Theory, 4, 302-311, 1972. doi: 10.1016/0022-314X(72)90057-1
- 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.
- Pankaj and Pruthi M., Cyclic codes from generalized cyclotomic sequences of order 2r, r ≥ 2, Journal of Information and Optimization Sciences, To Appear.
- Pankaj and Pruthi M., Cyclic codes from generalized cyclotomic sequences of order 2l, r ≥ 2, The Journal of the Indian Academy of Mathematics, 38(2), 183-209, 2016.
- Pruthi M. and Arora S. K., Minimal Codes of Length 2pn Finite Fields and Their Applications 5, 177-187, 1999. doi: 10.1006/ffta.1998.0238
- Pruthi M. and Arora S. K., Minimal Codes of Prime-Power Length, Finite Fields and Their Applications 3, 99-113, 1997. doi: 10.1006/ffta.1996.0156
- Pruthi M. and Pankaj, The minimum Hamming distances of the irreducible cyclic codes of length , Journal of Discrete Mathematical Sciences and Cryptography, 19(5-6), 965–995, 2016. doi: 10.1080/09720529.2015.1117201
- Pless V., Q-codes, Journal of Combinatorial Theory, 43(2), 258-276. 1986. doi: 10.1016/0097-3165(86)90066-X
- Pless V. and Huffman W. C., and Brualadi R.A, ”An introduction to algebraic codes”, edittied chaptor in Handbook of Coding Theory, volume 1 Eds. Amsterdam, Elsevier, 1998.
- V. Pless and W. C. Huffman, Eds. Amsterdam, the Netherlands, Elsevier, 1998.
- Pless V., Masley J. M. and Leon J. S., On weights in duadic codes, Journal of Combinatorial Theory, 44(1), 6-21, 1987. doi: 10.1016/0097-3165(87)90056-2
- Edemskiy,Nikita Sokolovskiy studied cubic sequences over finite fields ,2016 Third International conference on Mathematics and computers in sciences and in industry
- Storer T., Cyclotomy and difference sets, Markham, Chicago, 1967.
- 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.
- Whiteman A. L., A family of difference sets, Illionois J. Math 6, 107–121, 1962. doi: 10.1215/ijm/1255631810
- 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. doi: 10.3934/amc.2016036