On the covering radius of DNA code over a finite ring

Author

Department of Mathematics, Srimad Andavan Arts and Science College(A), Tiruchirappalli, Taminadu, India

Abstract

In this paper, lower bound and upper bound on the covering radius of
DNA codes over a finite ring N with respect to Chinese euclidean distance
are given. Also determine the covering radius of various Repetition DNA
codes, Simplex DNA code Type α and Simplex DNA code Type β and
bounds on the covering radius for MacDonald DNA codes of both types
over N.

Graphical Abstract

On the covering radius of DNA code over a finite ring

Keywords


[1] M. L. Adleman, Molecular computation of solutions to combinatorial problems, Science 266 (1994) 1021-1024.
[2] T. Aoki, P. Gaborit, M. Harada, M. Ozeki, P. Sol’e, On the covering radius of Z4 codes and their
lattices, IEEE Trans. Inform. Theory 45(6) (1999) 2162-2168.
[3] M. C. Bhandari, M. K. Gupta, A. K. Lal, On Z4 simplex codes and their gray images, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, AAECC- 13, Lecture Notes in Computer
Science 1719(1999) 170-180.
[4] A. Bonnecaze, P. Sol’e, C. Bachoc, B. Mourrain, Type II codes over Z4, IEEE Trans. Inform. Theory
43 (1997) 969-976.
[5] P. Chella Pandian, On the covering radius of codes over Z4 with chinese euclidean weight, International Journal on Information Theory (IJIT) 4(4) (2015) 1-8.
[6] G. D. Cohen, M. G. Karpovsky, H. F. Mattson, J. R. Schatz, Covering radius- survey and recent
results, IEEE Trans. Inform. Theory 31(3) (1985) 328-343.
[7] C. Cohen, A. Lobstein, N. J. A. Sloane, Further results on the covering radius of codes, IEEE Trans. Inform. Theory 32(5) (1986) 680-694.
[8] C. J. Colbourn, M. K. Gupta, On quaternary MacDonald codes, in: Proc. Information Technology:
Coding and Computing (ITCC), 2003, 212-215.
[9] J. H. Conway, N. J. A. Sloane, Self-dual codes over the integers modulo 4, Journal of Combin.
Theory Ser. A 62 (1993) 30-45.
[10] S. Dodunekov, J. Simonis, Codes and projective multisets. Electron. J. Combin 5(1) (1998) 23.
[11] S. T. Dougherty, M. Harada, P. Sol’e, Shadow codes over Z4, Finite Fields and Their Appl. (to
appear).
[12] C. Durairajan, On Covering Codes and Covering Radius of Some Optimal Codes, Ph. D. Thesis,
Department of Mathematics, IIT Kanpur, 1996.
[13] M. K. Gupta, C. Durairajan, On the covering radius of some modular codes, Journal of Advances in Mathematics of Computations 8(2) (2014) 9.
[14] M. K. Gupta, G. Glynn David, T. Aaron Gulliver, On Senary Simplex Codes, In: S. Boztas¸, I.E.
Shparlinski, (eds) Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. AAECC.
Lecture Notes in Computer Science, 2227. Springer, Berlin, Heidelberg, 2001.
[15] A. R. Hammons, P. V. Kumar, A. R. Calderbank, N. J. A. Sloane, P., Sol’e, The Z4-linearity of kerdock, preparata, goethals, and related codes, IEEE Trans. Inform. Theory 40(1994) 301-319.
[16] M. Harada, New extremal Type II codes over Z4, Des. Codes and Cryptogr. 13 (1998) 271-284 .
[17] D. J.Watson, C. H. F. Crick, A structure for deoxyribose nucleic acid, Nature. 25 (1953) 737-738.
Volume 8, Issue 2
July 2023
Pages 73-80
  • Receive Date: 26 April 2023
  • Revise Date: 04 May 2023
  • Accept Date: 22 May 2023
  • Publish Date: 01 June 2023