On self-dual cyclic codes over finite chain rings

From MaRDI portal
Publication:2439736

DOI10.1007/S10623-012-9696-0zbMATH Open1323.94164arXiv1212.3704OpenAlexW2044689213MaRDI QIDQ2439736FDOQ2439736


Authors: Aicha Batoul, T. Aaron Gulliver, Kenza Guenda Edit this on Wikidata


Publication date: 17 March 2014

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Abstract: For lambda an n-th power of a unit in a finite chain ring we prove that lambda-constacyclic repeated-root codes over some finite chain rings are equivalent to cyclic codes. This allows us to simplify the structure of some constacylic codes. We also study the -constacyclic codes of length ps over the Galois ring GR(pe,r).


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




Recommendations




Cites Work


Cited In (28)





This page was built for publication: On self-dual cyclic codes over finite chain rings

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