Hamming distance of repeated-root constacyclic codes of length $$2p^s$$ over $${\mathbb {F}}_{p^m}+u{\mathbb {F}}_{p^m}$$
Crossref DOI link: https://doi.org/10.1007/s00200-020-00432-0
Published Online: 2020-04-24
Published Print: 2020-06
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Dinh, Hai Q.
Gaur, A.
Gupta, Indivar
Singh, Abhay K.
Singh, Manoj Kumar
Tansuchat, Roengchai
Text and Data Mining valid from 2020-04-24
Version of Record valid from 2020-04-24
Article History
Received: 8 November 2019
Accepted: 7 April 2020
First Online: 24 April 2020