Table of Contents
ISRN Combinatorics
Volume 2014 (2014), Article ID 237915, 5 pages
http://dx.doi.org/10.1155/2014/237915
Research Article

On Normal -Ary Codes in Rosenbloom-Tsfasman Metric

Department of Mathematics, National Institute of Technology Warangal, Andhra Pradesh 506004, India

Received 10 February 2014; Accepted 17 March 2014; Published 2 April 2014

Academic Editors: A. Cossidente, E. Manstavicius, and S. Richter

Copyright © 2014 R. S. Selvaraj and Venkatrajam Marka. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. P. Delsarte, “Four fundamental parameters of a code and their combinatorial significance,” Information and Control, vol. 23, no. 5, pp. 407–438, 1973. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  2. G. D. Cohen, M. G. Karpovsky, H. F. Mattson, and J. R. Schatz, “Covering radius—survey and recent results,” IEEE Transactions on Information Theory, vol. 31, no. 3, pp. 328–343, 1985. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  3. G. D. Cohen, S. N. Litsyn, A. C. Lobstein, and H. F. Mattson Jr., “Covering radius 1985–1994,” Applicable Algebra in Engineering, Communications and Computing, vol. 8, no. 3, pp. 173–239, 1997. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  4. G. D. Cohen, I. Honkala, S. Litsyn, and A. Lobstein, Covering Codes, Elsevier, North-Holland, The Netherlands, 1997. View at Zentralblatt MATH
  5. R. L. Graham and N. J. A. Sloane, “On the covering radius of codes,” IEEE Transactions on Information Theory, vol. 31, no. 3, pp. 385–401, 1985. View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  6. G. D. Cohen, A. C. Lobstein, and N. J. A. Sloane, “Further results on the covering radius of codes,” IEEE Transactions on Information Theory, vol. 32, no. 6, pp. 680–694, 1986. View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  7. A. C. Lobstein and G. J. M. van Wee, “On normal and subnormal q-ary codes,” IEEE Transactions on Information Theory, vol. 35, no. 6, pp. 1291–1295, 1989. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  8. R. S. Selvaraj and V. Marka, “Normality of binary codes in Rosenbloom-Tsfasman metric,” in Proceedings of the International Conference on Advances in Computing, Communications and Informatics (ICACCI '13), pp. 1370–1373, August 2013.
  9. M. Yu. Rosenbloom and M. A. Tsfasman, “Codes for the m-metric,” Problems of Information Transmission, vol. 33, pp. 45–52, 1997. View at Google Scholar
  10. M. M. Skriganov, “Coding theory and uniform distributions,” St. Petersburg Mathematical Journal, vol. 143, no. 2, pp. 301–337, 2002. View at Google Scholar · View at Zentralblatt MATH
  11. I. Siap and M. Ozen, “The complete weight enumerator for codes over Mn×sR with respect to the Rosenbloom-Tsfasman metric,” Applied Mathematics Letters, vol. 17, no. 1, pp. 65–69, 2004. View at Publisher · View at Google Scholar · View at Scopus
  12. S. T. Dougherty and K. Shiromoto, “Maximum distance codes in Matn×sk with a non-hamming metric and uniform distributions,” Designs, Codes, and Cryptography, vol. 33, no. 1, pp. 45–61, 2004. View at Publisher · View at Google Scholar · View at Scopus
  13. S. Jain, “CT bursts—from classical to array coding,” Discrete Mathematics, vol. 308, no. 9, pp. 1489–1499, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  14. B. Yildiz, I. Siap, T. Bilgin, and G. Yesilot, “The covering problem for finite rings with respect to the RT-metric,” Applied Mathematics Letters, vol. 23, no. 9, pp. 988–992, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus