Hamming distance of repeated-root constacyclic codes of length 2 ps over Fpm+uFpm

Please use this identifier to cite or link to this item: http://cmuir.cmu.ac.th/jspui/handle/6653943832/70711

Title:	Hamming distance of repeated-root constacyclic codes of length 2 p<sup>s</sup> over F<sup>pm</sup>+uF<sup>pm</sup>
Authors:	Hai Q. Dinh A. Gaur Indivar Gupta Abhay K. Singh Manoj Kumar Singh Roengchai Tansuchat
Authors:	Hai Q. Dinh A. Gaur Indivar Gupta Abhay K. Singh Manoj Kumar Singh Roengchai Tansuchat
Keywords:	Mathematics
Issue Date:	1-Jun-2020
Abstract:	© 2020, Springer-Verlag GmbH, DE. Let p be an odd prime, and δ be an arbitrary unit of the finite chain ring Fpm+uFpm(u2=0). The Hamming distances of all δ-constacyclic codes of length 2 ps over Fpm+uFpm are completely determined. We provide some examples from which some codes have better parameters than the existing ones. As applications, we determine all MDS repeated-root δ-constacyclic codes of length 2 ps over Fpm+uFpm.
URI:	https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85084139448&origin=inward http://cmuir.cmu.ac.th/jspui/handle/6653943832/70711
ISSN:	09381279
Appears in Collections:	CMUL: Journal Articles

Files in This Item:

There are no files associated with this item.