On self-dual cyclic codes of length p^a over GR(p^2,s)

From MaRDI portal
Publication:326295

DOI10.3934/AMC.2016004zbMATH Open1348.94092arXiv1401.6634OpenAlexW2345948083WikidataQ62577985 ScholiaQ62577985MaRDI QIDQ326295FDOQ326295


Authors: Somphong Jitman, San Ling, Ekkasit Sangwisut Edit this on Wikidata


Publication date: 12 October 2016

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Abstract: In this paper, we study cyclic codes over the Galois ring mGR(p2,s). The main result is the characterization and enumeration of Hermitian self-dual cyclic codes of length pa over mGR(p2,s). Combining with some known results and the standard Discrete Fourier Transform decomposition, we arrive at the characterization and enumeration of Euclidean self-dual cyclic codes of any length over mGR(p2,s). Some corrections to results on Euclidean self-dual cyclic codes of even length over mathbbZ4 in Discrete Appl. Math. 128, (2003), 27 and Des. Codes Cryptogr. 39, (2006), 127 are provided.


Full work available at URL: https://arxiv.org/abs/1401.6634




Recommendations




Cites Work


Cited In (15)





This page was built for publication: On self-dual cyclic codes of length \(p^a\) over \(\mathrm{GR}(p^2,s)\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q326295)