Optimal constructions of quantum and synchronizable codes from repeated-root cyclic codes of length $$3p^s$$
Crossref DOI link: https://doi.org/10.1007/s11128-023-03958-7
Published Online: 2023-06-24
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Dinh, Hai Q.
Nguyen, Bac T.
Paravee, M.
Thi, Hiep L.
Vo, Thang M.
Text and Data Mining valid from 2023-06-24
Version of Record valid from 2023-06-24
Article History
Received: 13 August 2021
Accepted: 31 March 2023
First Online: 24 June 2023
Declarations
:
: The authors declare no conflicts of interest.