A note on “H. Q. Dinh et al., 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-021-00492-w
Published Online: 2021-02-01
Published Print: 2023-03
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Laaouine, Jamal
Charkani, Mohammed Elhassani
Text and Data Mining valid from 2021-02-01
Version of Record valid from 2021-02-01
Article History
Received: 19 February 2020
Revised: 30 November 2020
Accepted: 7 January 2021
First Online: 1 February 2021