Hamming distance of repeated-root constacyclic codes of length 2 p^s over F^pm+uF^pm

• Main Authors: Hai Q. Dinh, A. Gaur, Indivar Gupta, Abhay K. Singh, Manoj Kumar Singh, Roengchai Tansuchat
• Format: Journal
• Published: 2020
• Subjects: Mathematics
• Online Access: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85084139448&origin=inward; http://cmuir.cmu.ac.th/jspui/handle/6653943832/70711
• Institution: Chiang Mai University

© 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...