http://repository.iitr.ac.in/handle/123456789/9840
Title: | A mass formula for negacyclic codes of length 2k and some good negacyclic codes over ℤ4+ uℤ4 |
Authors: | Bandi R.K. Bhaintwal, Maheshanand Aydin N. |
Published in: | Cryptography and Communications |
Abstract: | In this paper, we study negacyclic codes of length 2k over the ring R= ℤ4+ uℤ4, u2 = 0. We have obtained a mass formula for the number of negacyclic of length 2k over R. We have also determined the number of self-dual negacyclic codes of length 2k over R. This study has been further generalized to negacyclic codes of any even length using discrete Fourier transform approach over R. We have conducted an exhaustive search and obtained some new ℤ4-linear codes with good parameters. © 2015, Springer Science+Business Media New York. |
Citation: | Cryptography and Communications (2017), 9(2): 241-272 |
URI: | https://doi.org/10.1007/s12095-015-0172-3 http://repository.iitr.ac.in/handle/123456789/9840 |
Issue Date: | 2017 |
Publisher: | Springer New York LLC |
Keywords: | Codes over ℤ4+ uℤ4 Cyclic codes Negacyclic codes Repeated root cyclic codes |
ISSN: | 19362447 |
Author Scopus IDs: | 55995665400 32867546000 7005593252 |
Author Affiliations: | Bandi, R.K., Department of Mathematics, Indian Institute of Technology Roorkee, Roorkee, 247667, India Bhaintwal, M., Department of Mathematics, Indian Institute of Technology Roorkee, Roorkee, 247667, India Aydin, N., Department of Mathematics and Statistics, Kenyon College, Gambier, OH 43022, United States |
Funding Details: | The authors would like to thank anonymous referees for their careful reading and valuable suggestions which greatly improved the final presentation of the manuscript. The first author greatly acknowledges the financial support given by Ministry of Human Resources and Development, India. |
Corresponding Author: | Bandi, R.K.; Department of Mathematics, Indian Institute of Technology RoorkeeIndia; email: bandi.ramakrishna@gmail.com |
Appears in Collections: | Journal Publications [MA] |
Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.