{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T11:45:11Z","timestamp":1780919111523,"version":"3.54.1"},"reference-count":105,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2023,6,24]],"date-time":"2023-06-24T00:00:00Z","timestamp":1687564800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,24]],"date-time":"2023-06-24T00:00:00Z","timestamp":1687564800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"DOI":"10.1007\/s11128-023-03958-7","type":"journal-article","created":{"date-parts":[[2023,6,24]],"date-time":"2023-06-24T13:06:09Z","timestamp":1687611969000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Optimal constructions of quantum and synchronizable codes from repeated-root cyclic codes of length $$3p^s$$"],"prefix":"10.1007","volume":"22","author":[{"given":"Hai Q.","family":"Dinh","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bac T.","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M.","family":"Paravee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hiep L.","family":"Thi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thang M.","family":"Vo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2023,6,24]]},"reference":[{"key":"3958_CR1","doi-asserted-by":"crossref","first-page":"3065","DOI":"10.1109\/18.959288","volume":"47","author":"A Ashikhmin","year":"2001","unstructured":"Ashikhmin, A., Knill, E.: Nonbinary quantum stablizer codes. IEEE Trans. Inf. Theory 47, 3065\u20133072 (2001)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3958_CR2","doi-asserted-by":"crossref","first-page":"3824","DOI":"10.1103\/PhysRevA.54.3824","volume":"54","author":"H Bennett","year":"1996","unstructured":"Bennett, H., DiVincenzo, P., Smolin, A., Wooters, K.: Mixed state entanglement and quantum error correction. Phys. Rev. A 54, 3824 (1996)","journal-title":"Phys. Rev. A"},{"key":"3958_CR3","doi-asserted-by":"crossref","unstructured":"Berman, D.: Semisimple cyclic and Abelian codes. II, Kibernetika (Kiev), Vol 3, pp. 21-30, 1967 (Russian). English translation: Cybernetics, 3: 17-23, (1967)","DOI":"10.1007\/BF01119999"},{"key":"3958_CR4","doi-asserted-by":"crossref","first-page":"1345","DOI":"10.1103\/PhysRevLett.82.1345","volume":"82","author":"D Bouwmeester","year":"1999","unstructured":"Bouwmeester, D., Pan, J., Daniell, M., Weinfurter, H., Zeilinger, A.: Observation of Three-Photon Greenberger-Horne-Zeilinger Entanglement. Phys. Rev. Lett. 82, 1345 (1999)","journal-title":"Phys. Rev. Lett."},{"key":"3958_CR5","doi-asserted-by":"crossref","DOI":"10.1002\/0470845880","volume-title":"Synchronization of Digital Telecommunications Networks","author":"S Bregni","year":"2002","unstructured":"Bregni, S.: Synchronization of Digital Telecommunications Networks. John Wiley Sons, New York (2002)"},{"key":"3958_CR6","doi-asserted-by":"crossref","first-page":"436","DOI":"10.1126\/science.1131563","volume":"314","author":"T Brun","year":"2006","unstructured":"Brun, T., Devetak, I., Hsieh, H.: Correcting quantum errors with entanglement. Science 314, 436\u2013439 (2006)","journal-title":"Science"},{"key":"3958_CR7","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1214\/aoms\/1177729387","volume":"23","author":"KA Bush","year":"1952","unstructured":"Bush, K.A.: Orthogonal arrays of index unity. Ann. Math. Statist. 23, 426\u2013434 (1952)","journal-title":"Ann. Math. Statist."},{"key":"3958_CR8","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1103\/PhysRevA.54.1098","volume":"54","author":"AR Calderbank","year":"1996","unstructured":"Calderbank, A.R., Shor, P.W.: Good quantum error-correcting codes exist. Phys. Rev. A 54, 1098\u20131106 (1996)","journal-title":"Phys. Rev. A"},{"key":"3958_CR9","doi-asserted-by":"crossref","first-page":"1369","DOI":"10.1109\/18.681315","volume":"44","author":"AR Calderbank","year":"1998","unstructured":"Calderbank, A.R., Rains, E.M., Shor, P.W., Sloane, N.J.A.: Quantum error correction via codes over GF(4). IEEE Trans. Inform. Theory. 44, 1369\u20131387 (1998)","journal-title":"IEEE Trans. Inform. Theory."},{"key":"3958_CR10","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/18.75249","volume":"37","author":"G Castagnoli","year":"1991","unstructured":"Castagnoli, G., Massey, J.L., Schoeller, P.A., von Seemann, N.: On repeated-root cyclic codes. IEEE Trans. Inform. Theory. 37, 337\u2013342 (1991)","journal-title":"IEEE Trans. Inform. Theory."},{"key":"3958_CR11","doi-asserted-by":"crossref","first-page":"231","DOI":"10.3934\/amc.2018016","volume":"12","author":"Y Cao","year":"2018","unstructured":"Cao, Y., Cao, Y., Dinh, H.Q., Fu, F., Gao, J., Sriboonchitta, S.: Constacyclic codes of length $$np^s$$ over $$\\mathbb{F} _{p^m}+u\\mathbb{F} _{p^m}$$. Adv. Math. Commun. 12, 231\u2013262 (2018)","journal-title":"Adv. Math. Commun."},{"key":"3958_CR12","unstructured":"Cao, Y., Cao, Y., Dinh, H. Q., Fu, F., Gao, J., Sriboonchitta, S.:\u201cA class of repeated-root constacyclic codes over $${\\mathbb{F}}_{p^m} [u]\/\\langle u^e\\rangle $$ of Type 2., Finite Fields & Appl., pp. 238-267, (2019)"},{"key":"3958_CR13","doi-asserted-by":"crossref","first-page":"2077","DOI":"10.1016\/j.disc.2019.04.008","volume":"342","author":"Y Cao","year":"2019","unstructured":"Cao, Y., Cao, Y., Dinh, H.Q., Jitman, S.: An explicit representation and enumeration for self-dual cyclic codes over $$\\mathbb{F} _{2^m}+u\\mathbb{F} _{2^m}$$ of length $$2^s$$. Discrete Math. 342, 2077\u20132091 (2019)","journal-title":"Discrete Math."},{"key":"3958_CR14","doi-asserted-by":"crossref","first-page":"2050103","DOI":"10.1142\/S0219498820501030","volume":"19","author":"Y Cao","year":"2020","unstructured":"Cao, Y., Cao, Y., Dinh, H.Q., Fu, F., Gao, J., Sriboonchitta, S.: A class of linear codes of length 2 over fnite chain rings. J. Algebra Appl. 19, 2050103 (2020)","journal-title":"J. Algebra Appl."},{"key":"3958_CR15","unstructured":"Cao, Y. , Cao, Y., Dinh, H. Q., Fu, F., Ma, F.: Construction and enumeration for self-dual cyclic codes of even length over $${\\mathbb{F}}_{2^m} + u{\\mathbb{F}}_{2^m}$$\", Finite Fields & Appl., Vol 61 (in press) (2020)"},{"key":"3958_CR16","doi-asserted-by":"crossref","first-page":"111768","DOI":"10.1016\/j.disc.2019.111768","volume":"343","author":"Y Cao","year":"2020","unstructured":"Cao, Y., Cao, Y., Dinh, H.Q., Fu, F., Ma, F.: On matrix-product structure of repeatedroot constacyclic codes over fnite felds. Discrete Math. 343, 111768 (2020). ((in press))","journal-title":"Discrete Math."},{"key":"3958_CR17","unstructured":"Cao, Y., Cao, Y., Dinh, H. Q., Bandi, R., Fu, F.: An explicit representation and enumeration for negacyclic codes of length $$2^kn$$ over $${\\mathbb{Z}} _4+u{\\mathbb{Z}} _4$$, Adv. Math. Commun., (in press) (2020)"},{"key":"3958_CR18","doi-asserted-by":"crossref","first-page":"55550","DOI":"10.1109\/ACCESS.2020.2981453","volume":"8","author":"Y Cao","year":"2020","unstructured":"Cao, Y., Cao, Y., Dinh, H.Q., Bag, T., Yamaka, W.: \u201cExplicit representation and enumeration of repeated-root $$\\delta ^2+\\alpha u^2$$-constacyclic codes over $$\\mathbb{F} _{2^m}[u]\/\\langle u^{2\\lambda }$$. IEEE Access 8, 55550\u201355562 (2020)","journal-title":"IEEE Access"},{"key":"3958_CR19","doi-asserted-by":"crossref","first-page":"111868","DOI":"10.1016\/j.disc.2020.111868","volume":"343","author":"Y Cao","year":"2020","unstructured":"Cao, Y., Cao, Y., Dinh, H.Q., Jitman, S.: \u201cAn efcient method to construct self-dual cyclic codes of length $$p^s$$ over $$\\mathbb{F} _{p^m}+u\\mathbb{F} _{p^m}$$. Discrete Math. 343, 111868 (2020)","journal-title":"Discrete Math."},{"key":"3958_CR20","doi-asserted-by":"crossref","first-page":"1474","DOI":"10.1109\/TIT.2015.2388576","volume":"61","author":"B Chen","year":"2014","unstructured":"Chen, B., Ling, S., Zhang, G.: Application of Constacyclic codes to Quantum MDS Codes. IEEE Trans. Inform. Theory 61, 1474\u20131478 (2014)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"3958_CR21","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s11128-017-1750-4","volume":"16","author":"J Chen","year":"2017","unstructured":"Chen, J., Huang, Y., Feng, C., Chen, R.: Entanglement-assisted quantum MDS codes constructed from negacyclic codes. Quantum Inf. Process. 16, 303 (2017)","journal-title":"Quantum Inf. Process."},{"key":"3958_CR22","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1016\/j.dam.2014.05.046","volume":"177","author":"B Chen","year":"2014","unstructured":"Chen, B., Dinh, H.Q., Liu, H.: Repeated-root constacyclic codes of length $$\\ell p^s$$ and their duals. Discrete Appl. Math. 177, 60\u201370 (2014)","journal-title":"Discrete Appl. Math."},{"key":"3958_CR23","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1103\/PhysRevA.56.76","volume":"56","author":"R Cleve","year":"1997","unstructured":"Cleve, R., Gottesman, D.: Efficient computations of encodings for quantum error correction. Phys. Rev. A 56, 76 (1997)","journal-title":"Phys. Rev. A"},{"key":"3958_CR24","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1098\/rspa.1985.0070","volume":"400","author":"D Deutsch","year":"1985","unstructured":"Deutsch, D.: Quantum theory, the Church-Turing principle and the universal quantum computer. Proc. Royal Soci. Lond. A 400, 97\u2013117 (1985)","journal-title":"Proc. Royal Soci. Lond. A"},{"key":"3958_CR25","doi-asserted-by":"crossref","first-page":"940","DOI":"10.1016\/j.jalgebra.2010.05.027","volume":"324","author":"HQ Dinh","year":"2010","unstructured":"Dinh, H.Q.: Constacyclic codes of length $$p^s$$ over $$\\mathbb{F} _{p^m}+u\\mathbb{F} _{p^m}$$. J. Algebra 324, 940\u2013950 (2010)","journal-title":"J. Algebra"},{"key":"3958_CR26","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/j.ffa.2011.07.003","volume":"18","author":"HQ Dinh","year":"2012","unstructured":"Dinh, H.Q.: Repeated-root constacyclic codes of length $$2p^s$$. Finite Fields Appl. 18, 133\u2013143 (2012)","journal-title":"Finite Fields Appl."},{"key":"3958_CR27","first-page":"983","volume":"313","author":"HQ Dinh","year":"2013","unstructured":"Dinh, H.Q.: Structure of repeated-root constacyclic codes of length $$3p^s$$ and their duals. Discrete Appl. Math. 313, 983\u2013991 (2013)","journal-title":"Discrete Appl. Math."},{"key":"3958_CR28","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1090\/conm\/609\/12150","volume":"609","author":"HQ Dinh","year":"2014","unstructured":"Dinh, H.Q.: Repeated-Root cyclic and negacyclic codes of length $$6p^s$$. Contemp. Math. 609, 69\u201387 (2014)","journal-title":"Contemp. Math."},{"key":"3958_CR29","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1016\/j.disc.2016.11.014","volume":"340","author":"HQ Dinh","year":"2017","unstructured":"Dinh, H.Q., Dhompongsa, S., Sriboonchitta, S.: On constacyclic codes of length $$4p^s$$ over $$\\mathbb{F} _{p^m} + u\\mathbb{F} _{p^m}$$. Discrete Math. 340, 832\u2013849 (2017)","journal-title":"Discrete Math."},{"key":"3958_CR30","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.ffa.2016.07.011","volume":"43","author":"HQ Dinh","year":"2017","unstructured":"Dinh, H.Q., Nguyen, H.D.T., Sriboonchitta, S., Vo, T.M.: Repeated-root constacyclic codes of prime power lengths over finite chain rings. Finite Fields Appl. 43, 22\u201341 (2017)","journal-title":"Finite Fields Appl."},{"key":"3958_CR31","doi-asserted-by":"crossref","first-page":"1950022","DOI":"10.1142\/S0219498819500221","volume":"18","author":"HQ Dinh","year":"2019","unstructured":"Dinh, H.Q., Nguyen, B.T., Sriboonchitta, S., Vo, T.M.: On a class of constacyclic codes of length $$4p^s$$ over $$\\mathbb{F} _{p^m} + u\\mathbb{F} _{p^m}$$. J. Algebra Appl. 18, 1950022 (2019)","journal-title":"J. Algebra Appl."},{"key":"3958_CR32","doi-asserted-by":"crossref","first-page":"1950023","DOI":"10.1142\/S0219498819500233","volume":"18","author":"HQ Dinh","year":"2019","unstructured":"Dinh, H.Q., Nguyen, B.T., Sriboonchitta, S., Vo, T.M.: On $$(\\alpha + u\\beta )$$-constacyclic codes of length $$4p^s$$ over $$\\mathbb{F} _{p^m} + u\\mathbb{F} _{p^m}$$. J. Algebra Appl. 18, 1950023 (2019)","journal-title":"J. Algebra Appl."},{"key":"3958_CR33","doi-asserted-by":"crossref","first-page":"1055","DOI":"10.1016\/j.disc.2017.12.019","volume":"341","author":"HQ Dinh","year":"2018","unstructured":"Dinh, H.Q., Nguyen, B.A.C.T., Sriboonchitta, S.: Negacyclic codes of length $$4p^s$$ over $${\\mathbb{F} } _{p^m} + u{\\mathbb{F} } _{p^m}$$. Discrete Math. 341, 1055\u20131071 (2018)","journal-title":"Discrete Math."},{"key":"3958_CR34","doi-asserted-by":"crossref","first-page":"124608","DOI":"10.1109\/ACCESS.2020.3006001","volume":"8","author":"HQ Dinh","year":"2020","unstructured":"Dinh, H.Q., Nguyen, B.T., Yamaka, W.: Quantum MDS and synchronizable codes from cyclic and negacyclic codes of length $$2p^s$$ over $${\\mathbb{F} }_{p^m}$$\u2019\u2019. IEEE Access 8, 124608\u2013124623 (2020)","journal-title":"IEEE Access"},{"key":"3958_CR35","first-page":"1","volume":"70","author":"HQ Dinh","year":"2020","unstructured":"Dinh, H.Q., Wang, X., Liu, H., Sriboonchitta, S.: Hamming distances of constacyclic codes of length $$3p^s$$ and optimal codes with respect to the Griesmer and Singleton bounds. Discrete Appl. Math. 70, 1\u201322 (2020)","journal-title":"Discrete Appl. Math."},{"key":"3958_CR36","volume-title":"Latin squares and their applications","author":"J Denes","year":"1974","unstructured":"Denes, J., Keedwell, A.D.: Latin squares and their applications. Academic Press, New York (1974)"},{"key":"3958_CR37","first-page":"926","volume":"4","author":"M El-Khamy","year":"2005","unstructured":"El-Khamy, M., McEliece, R.J.: The partition weight enumerator of MDS codes and its applications. Proc. Int. Symp. Inf. Theory ISIT 4, 926\u2013930 (2005)","journal-title":"Proc. Int. Symp. Inf. Theory ISIT"},{"key":"3958_CR38","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/j.ffa.2018.06.003","volume":"53","author":"W Fang","year":"2018","unstructured":"Fang, W., Fu, F.: Two new classes of quantum MDS codes. Finite Fields Appl. 53, 85\u201398 (2018)","journal-title":"Finite Fields Appl."},{"key":"3958_CR39","doi-asserted-by":"crossref","first-page":"7840","DOI":"10.1109\/TIT.2019.2939114","volume":"65","author":"W Fang","year":"2019","unstructured":"Fang, W., Fu, F.: Some new constructions of quantum MDS codes. IEEE Trans. Inf. Theory 65, 7840\u20137847 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3958_CR40","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1109\/TIT.1964.1053680","volume":"10","author":"SW Golomb","year":"1964","unstructured":"Golomb, S.W., Posner, E.C.: Rook domains, Latin squares, affine planes, and error-distributing codes. IEEE Trans. Inform. Theory. 10, 196\u2013208 (1964)","journal-title":"IEEE Trans. Inform. Theory."},{"key":"3958_CR41","doi-asserted-by":"crossref","first-page":"757","DOI":"10.1142\/S0219749904000079","volume":"2","author":"M Grassl","year":"2004","unstructured":"Grassl, M., Beth, T., R\u022ftteler, M.: On optimal quantum codes. Int. J. Quantum Inform. 2, 757\u2013766 (2004)","journal-title":"Int. J. Quantum Inform."},{"key":"3958_CR42","unstructured":"Grassl, M., Klappenecker, A., Rotteler, M.: Graphs, quadratic forms, and quantum codes,In: Proceedings 2002 IEEE International Symposium on Information Theory, pp. 45, (2002)"},{"key":"3958_CR43","doi-asserted-by":"crossref","unstructured":"Grassl, M., Beth, T., Geiselmann, W.: Quantum reed-solomon codes, AAECC-13. Honolulu, HI, USA (1999)","DOI":"10.1007\/3-540-46796-3_23"},{"key":"3958_CR44","series-title":"In Proc. X. Intl. Symp.","first-page":"207","volume-title":"Quantum BCH codes","author":"M Grassl","year":"1999","unstructured":"Grassl, M., Beth, T.: Quantum BCH codes. In Proc. X. Intl. Symp., pp. 207\u2013212. Theoretical Electrical Engineering, Magdeburg (1999)"},{"key":"3958_CR45","unstructured":"Grassl, M.: Bounds on the minimum distance of linear codes and quantum codes. available online at http:\/\/www.codetables.de, accessed 2021-04-14 (2007)"},{"key":"3958_CR46","doi-asserted-by":"crossref","first-page":"042331","DOI":"10.1103\/PhysRevA.80.042331","volume":"80","author":"GGL Guardia","year":"2009","unstructured":"Guardia, G.G.L.: Constructions of new families of nonbinary quantum codes. Phys. Rev. A 80, 042331\u201304233 (2009)","journal-title":"Phys. Rev. A"},{"key":"3958_CR47","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/s10623-017-0330-z","volume":"86","author":"K Guenda","year":"2018","unstructured":"Guenda, K., Jitman, S., Gulliver, T.A.: Constructions of good entanglement-assisted quantum error correcting codes. Des. Codes Crypt. 86, 121\u2013136 (2018)","journal-title":"Des. Codes Crypt."},{"key":"3958_CR48","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1103\/PhysRevA.87.022344","volume":"87","author":"Y Fujiwara","year":"2013","unstructured":"Fujiwara, Y.: Block synchronization for quantum information. Phys. Rev. A 87, 109\u2013120 (2013)","journal-title":"Phys. Rev. A"},{"key":"3958_CR49","doi-asserted-by":"crossref","first-page":"2328","DOI":"10.1109\/TIT.2012.2234501","volume":"59","author":"Y Fujiwara","year":"2013","unstructured":"Fujiwara, Y., Tonchev, D.: High-rate self-synchronizing codes. IEEE Trans. Inform. Theory. 59, 2328\u20132335 (2013)","journal-title":"IEEE Trans. Inform. Theory."},{"key":"3958_CR50","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1103\/PhysRevA.88.012318","volume":"88","author":"Y Fujiwara","year":"2013","unstructured":"Fujiwara, Y., Tonchev, D., Wong, H.: Algebraic techniques in designing quantum synchronizable codes. Phys. Rev. A 88, 162\u2013166 (2013)","journal-title":"Phys. Rev. A"},{"key":"3958_CR51","doi-asserted-by":"crossref","first-page":"7345","DOI":"10.1109\/TIT.2014.2357029","volume":"60","author":"Y Fujiwara","year":"2014","unstructured":"Fujiwara, Y., Vandendriessche, P.: Quantum synchronizable codes from finite geometries. IEEE Trans. Inform. Theory. 60, 7345\u20137354 (2014)","journal-title":"IEEE Trans. Inform. Theory."},{"key":"3958_CR52","unstructured":"Gottesman. D.: PhD Thesis (Caltech). quantph\/9705052, (1997)"},{"key":"3958_CR53","first-page":"1","volume":"78","author":"D Hu","year":"2008","unstructured":"Hu, D., Tang, W., Zhao, M., Chen, Q., Yu, S., Oh, C.: Graphical nonbinary quantum error-correcting codes. Phys. Rev. A 78, 1\u201311 (2008)","journal-title":"Phys. Rev. A"},{"key":"3958_CR54","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0019-9958(58)80006-6","volume":"3","author":"D Joshi","year":"1958","unstructured":"Joshi, D.: A Note on Upper Bounds for Minimum Distance Codes. Inf. Control 3, 289\u2013295 (1958)","journal-title":"Inf. Control"},{"key":"3958_CR55","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/s10623-016-0281-9","volume":"84","author":"L Jin","year":"2017","unstructured":"Jin, L., Kan, H., Wen, J.: Quantum MDS codes with relatively large minimum distance from Hermitian self-orthogonal codes. Des. Codes Crypt. 84, 463\u2013471 (2017)","journal-title":"Des. Codes Crypt."},{"key":"3958_CR56","doi-asserted-by":"crossref","first-page":"4735","DOI":"10.1109\/TIT.2010.2054174","volume":"56","author":"L Jin","year":"2010","unstructured":"Jin, L., Ling, S., Luo, J., Xing, C.: Application of classical Hermitian self-orthogonal MDS codes to quantum MDS codes. IEEE Trans. Inform. Theory. 56, 4735\u20134740 (2010)","journal-title":"IEEE Trans. Inform. Theory."},{"key":"3958_CR57","doi-asserted-by":"crossref","first-page":"2921","DOI":"10.1109\/TIT.2014.2299800","volume":"60","author":"L Jin","year":"2014","unstructured":"Jin, L., Xing, C.: A construction of new quantum MDS codes. IEEE Trans. Inform. Theory. 60, 2921\u20132925 (2014)","journal-title":"IEEE Trans. Inform. Theory."},{"key":"3958_CR58","unstructured":"Komamiya, Y.: Application of logical mathematics to information theory. (Application of theory of groups to logical mathematics.). In: Proceedings of the Third Japan National Congress for Applied Mechanics, 1953, pages 437-442, Tokyo, Science Council of Japan (1954)"},{"key":"3958_CR59","doi-asserted-by":"crossref","first-page":"1193","DOI":"10.1109\/TIT.2012.2220519","volume":"2","author":"X Kai","year":"2013","unstructured":"Kai, X., Zhu, S.: New quantum MDS codes from negacyclic codes. IEEE Trans. Inform. Theory. 2, 1193\u20131197 (2013)","journal-title":"IEEE Trans. Inform. Theory."},{"key":"3958_CR60","doi-asserted-by":"crossref","first-page":"5828","DOI":"10.1109\/TIT.2015.2481889","volume":"11","author":"X Kai","year":"2015","unstructured":"Kai, X., Zhu, S., Li, P.: A construction of new MDS symbol-pair codes. IEEE Trans. Inform. Theory. 11, 5828\u20135834 (2015)","journal-title":"IEEE Trans. Inform. Theory."},{"key":"3958_CR61","doi-asserted-by":"crossref","first-page":"900","DOI":"10.1103\/PhysRevA.55.900","volume":"55","author":"E Knill","year":"1997","unstructured":"Knill, E., Laflamme, R.: Theory of quantum error-correcting codes. Phys. Rev. A 55, 900\u2013911 (1997)","journal-title":"Phys. Rev. A"},{"key":"3958_CR62","doi-asserted-by":"crossref","first-page":"2525","DOI":"10.1103\/PhysRevLett.84.2525","volume":"84","author":"E Knill","year":"2000","unstructured":"Knill, E., Laflamme, R.: A theory of quantum error-correcting codes. Phys. Rev. Lett. 84, 2525 (2000)","journal-title":"Phys. Rev. Lett."},{"key":"3958_CR63","doi-asserted-by":"crossref","first-page":"4337","DOI":"10.1103\/PhysRevLett.75.4337","volume":"75","author":"G Kwiat","year":"1995","unstructured":"Kwiat, G., Mattle, K., Weinfurter, H., Zeilinger, A., Sergienko, V., Shih, Y.: New high-intensity source of polarization-entangled photon pairs. Phys. Rev. Lett. 75, 4337 (1995)","journal-title":"Phys. Rev. Lett."},{"key":"3958_CR64","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139034807","volume-title":"Quantum Error Correction","author":"A Lidar","year":"2013","unstructured":"Lidar, A., Brun, A.: Quantum Error Correction. Cambridge University Press, Cambridge (2013)"},{"key":"3958_CR65","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/j.ffa.2016.08.005","volume":"42","author":"L Liu","year":"2016","unstructured":"Liu, L., Li, L.Q., Kai, X., Zhu, S.: Repeated-root constacyclic codes of length $$3lp^n$$ and their dual codes. Finite Fields Appl. 42, 269\u2013295 (2016)","journal-title":"Finite Fields Appl."},{"key":"3958_CR66","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/s11128-019-2300-z","volume":"18","author":"X Liu","year":"2019","unstructured":"Liu, X., Liu, H., Yu, L.: Entanglement-assisted quantum codes from matrix-product codes. Quantum Inf. Process. 18, 183 (2019)","journal-title":"Quantum Inf. Process."},{"key":"3958_CR67","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/j.ffa.2018.09.001","volume":"55","author":"X Liu","year":"2019","unstructured":"Liu, X., Yu, L., Hu, P.: New entanglement-assisted quantum codes from k-Galois dual codes. Finite Fields Appl. 55, 21\u201332 (2019)","journal-title":"Finite Fields Appl."},{"key":"3958_CR68","first-page":"1","volume":"14","author":"L Luo","year":"2015","unstructured":"Luo, L., Ma, Z.: Non-binary quantum synchronizable codes from repeated-root cyclic codes. IEEE Trans. Inform. Theory. 14, 1\u201310 (2015)","journal-title":"IEEE Trans. Inform. Theory."},{"key":"3958_CR69","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11128-018-2112-6","volume":"18","author":"L Luo","year":"2019","unstructured":"Luo, L., Ma, Z., Lin, D.: Two new families of quantum synchronizable codes. Quantum Inf. Process. 18, 1\u201318 (2019)","journal-title":"Quantum Inf. Process."},{"key":"3958_CR70","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1103\/PhysRevLett.77.198","volume":"77","author":"R Laflamme","year":"1996","unstructured":"Laflamme, R., Miquel, C., Paz, P., Zurek, H.: Perfect quantum error correcting code. Phys. Rev. Lett. 77, 198 (1996)","journal-title":"Phys. Rev. Lett."},{"key":"3958_CR71","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1109\/18.75250","volume":"37","author":"JH van Lint","year":"1991","unstructured":"van Lint, J.H.: Repeated-root cyclic codes. IEEE Trans. Inform. Theory. 37, 343\u2013345 (1991)","journal-title":"IEEE Trans. Inform. Theory."},{"key":"3958_CR72","first-page":"1","volume":"77","author":"Z Li","year":"2008","unstructured":"Li, Z., Xing, J., Wang, M.: Quantum generalized Reed-Solomon codes: unified framework for quantum maximum-distanceseparable codes. Phys. Rev. A 77, 1\u20134 (2008)","journal-title":"Phys. Rev. A"},{"key":"3958_CR73","volume-title":"The theory of error-correcting Codes, $$10^{th}$$ impression","author":"J MacWilliams","year":"1998","unstructured":"MacWilliams, J., Sloane, J.A.: The theory of error-correcting Codes, $$10^{th}$$ impression. North-Holland, Amsterdam (1998)"},{"key":"3958_CR74","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1016\/0097-3165(71)90036-7","volume":"11","author":"C Maneri","year":"1966","unstructured":"Maneri, C., Silverman, R.: A combinatorial problem with applications to geometry. J. Comb. Theory Ser. A 11, 118\u2013121 (1966)","journal-title":"J. Comb. Theory Ser. A"},{"key":"3958_CR75","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1109\/TIT.1973.1054936","volume":"19","author":"L Massey","year":"1973","unstructured":"Massey, L., Costello, J., Justesen, J.: Polynomial weights and code constructions. IEEE Trans. Inform. Theory. 19, 101\u2013110 (1973)","journal-title":"IEEE Trans. Inform. Theory."},{"key":"3958_CR76","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1038\/nphoton.2009.93","volume":"3","author":"F Matthews","year":"2009","unstructured":"Matthews, F., Politi, A., Stefanov, A., O\u2019Brien, J.L.: Manipulation of multiphoton entanglement in waveguide quantum circuits. Nat. Photon. 3, 346\u2013350 (2009)","journal-title":"Nat. Photon."},{"key":"3958_CR77","volume-title":"Quantum Computation and Quantum Information","author":"A Nielsen","year":"2010","unstructured":"Nielsen, A., Chuang, L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2010)"},{"key":"3958_CR78","doi-asserted-by":"crossref","unstructured":"Ozadam, H., Ozbudak , F.: The minimum Hamming distance of cyclic codes of length $$2p^s$$. In: International Symposium on Applied Algebra, Algebraic Algorithms, and Error-Correcting Codes, pp. 92-100, (2009)","DOI":"10.1007\/978-3-642-02181-7_10"},{"key":"3958_CR79","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.ffa.2012.10.002","volume":"19","author":"SR Lopez-Permouth","year":"2013","unstructured":"Lopez-Permouth, S.R., Ozadam, H., Ozbudak, F., Szabo, S.: Polycyclic codes over Galois rings with applications to repeated-root constacyclic codes. Finite Fields Appl. 19, 16\u201338 (2013)","journal-title":"Finite Fields Appl."},{"key":"3958_CR80","volume-title":"Handbook of Coding Theory","author":"V Pless","year":"1998","unstructured":"Pless, V., Huffman, W.C.: Handbook of Coding Theory. Elsevier, Amsterdam (1998)"},{"key":"3958_CR81","doi-asserted-by":"crossref","first-page":"1256","DOI":"10.1109\/TIT.2012.2230682","volume":"59","author":"Y Polyanskiy","year":"2013","unstructured":"Polyanskiy, Y.: Asynchronous communication: Exact synchronization, universality, and dispersion. IEEE Trans. Inform. Theory. 59, 1256\u20131270 (2013)","journal-title":"IEEE Trans. Inform. Theory."},{"key":"3958_CR82","unstructured":"Prange, E.: Cyclic error-correcting codes in two symbols, TN-57-103 (1957)"},{"key":"3958_CR83","doi-asserted-by":"crossref","first-page":"020503","DOI":"10.1103\/PhysRevLett.103.020503","volume":"103","author":"R Prevedel","year":"2009","unstructured":"Prevedel, R., Cronenberg, G., Tame, M.S., Paternostro, M., Walther, P., Kim, M.S., Zeilinger, A.: Experimental realization of dicke states of up to six qubits for multiparty quantum networking. Phys. Rev. Lett. 103, 020503 (2009)","journal-title":"Phys. Rev. Lett."},{"key":"3958_CR84","volume-title":"Digital communications: fundamentals and applications","author":"B Sklar","year":"2001","unstructured":"Sklar, B.: Digital communications: fundamentals and applications, 2nd edn. Prentice Hall, Upper Saddle River (2001)","edition":"2"},{"key":"3958_CR85","doi-asserted-by":"crossref","first-page":"150501","DOI":"10.1103\/PhysRevLett.103.150501","volume":"103","author":"M Radmark","year":"2009","unstructured":"Radmark, M., Zukowski, M., Bourennane, M.: Experimental test of fidelity limits in six-photon interferometry and of rotational invariance properties of the photonic six-qubit entanglement singlet State. Phys. Rev. Lett. 103, 150501 (2009)","journal-title":"Phys. Rev. Lett."},{"key":"3958_CR86","doi-asserted-by":"crossref","first-page":"1388","DOI":"10.1109\/18.681316","volume":"4","author":"M Rains","year":"1998","unstructured":"Rains, M.: Quantum weight Enumerators. IEEE Trans. Inform. Theory. 4, 1388\u20131394 (1998)","journal-title":"IEEE Trans. Inform. Theory."},{"key":"3958_CR87","unstructured":"Roman, S.: Coding and Information Theory, GTM, 134, Springer-Verlag, ISBN 0-387-97812-7, (1992)"},{"key":"3958_CR88","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1109\/TIT.1986.1057151","volume":"32","author":"M Roth","year":"1986","unstructured":"Roth, M., Seroussi, G.: On cyclic MDS codes of length $$q$$ over $$GF(q)$$. IEEE Trans. Inform. Theory. 32, 284\u2013285 (1986)","journal-title":"IEEE Trans. Inform. Theory."},{"key":"3958_CR89","doi-asserted-by":"crossref","first-page":"012308","DOI":"10.1103\/PhysRevA.65.012308","volume":"65","author":"D Schlingemann","year":"2001","unstructured":"Schlingemann, D., Werner, F.: Quantum error-correcting codes associated with graphs. Phys. Rev. A 65, 012308 (2001)","journal-title":"Phys. Rev. A"},{"key":"3958_CR90","first-page":"307","volume":"2","author":"D Schlingemann","year":"2002","unstructured":"Schlingemann, D.: Stabilizer codes can be realized as graph codes. Quantum Inf. Comput. 2, 307\u2013323 (2002)","journal-title":"Quantum Inf. Comput."},{"key":"3958_CR91","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/j.ffa.2017.04.002","volume":"46","author":"X Shi","year":"2017","unstructured":"Shi, X., Yue, Q., Zhu, X.: Construction of some new quantum MDS codes. Finite Fields Appl. 46, 347\u2013362 (2017)","journal-title":"Finite Fields Appl."},{"key":"3958_CR92","doi-asserted-by":"crossref","first-page":"2493","DOI":"10.1103\/PhysRevA.52.R2493","volume":"52","author":"W Shor","year":"1995","unstructured":"Shor, W.: Scheme for reducing decoherence in quantum computer memory. Phys. Rev. A 52, 2493 (1995)","journal-title":"Phys. Rev. A"},{"key":"3958_CR93","doi-asserted-by":"crossref","first-page":"158","DOI":"10.4153\/CJM-1960-014-0","volume":"12","author":"R Silverman","year":"1960","unstructured":"Silverman, R.: A metrization for power-sets with applications to combinatorial analysis. Canad. J. Math. 12, 158\u2013176 (1960)","journal-title":"Canad. J. Math."},{"key":"3958_CR94","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1103\/PhysRevLett.77.793","volume":"77","author":"M Steane","year":"1996","unstructured":"Steane, M.: Error correcting codes in quantum theory. Phys. Rev. Lett. 77, 793 (1996)","journal-title":"Phys. Rev. Lett."},{"key":"3958_CR95","doi-asserted-by":"crossref","first-page":"2492","DOI":"10.1109\/18.796388","volume":"45","author":"M Steane","year":"1999","unstructured":"Steane, M.: Enlargement of Calderbank-Shor-Steane quantum codes. IEEE Trans. Inform. Theory. 45, 2492\u20132495 (1999)","journal-title":"IEEE Trans. Inform. Theory."},{"key":"3958_CR96","doi-asserted-by":"crossref","unstructured":"Tolhuizen, M.: On Maximum distance separable codes over alphabets of arbitrary size. In: Proc. Int. Symp. Inf. Theory ISIT, pp. 431, (1994)","DOI":"10.1109\/ISIT.1994.395046"},{"key":"3958_CR97","first-page":"1","volume":"5","author":"J Wang","year":"2020","unstructured":"Wang, J., Li, R., Lv, J., Song, H.: Entanglement-assisted quantum codes from cyclic codes and negacyclic codes. Quantum Inf. Process. 5, 1\u201318 (2020)","journal-title":"Quantum Inf. Process."},{"key":"3958_CR98","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s11128-019-2494-0","volume":"19","author":"L Wang","year":"2020","unstructured":"Wang, L., Zhu, S., Sun, Z.: Entanglement-assisted quantum MDS codes from cyclic codes. Quantum Inf. Process. 19, 1\u201318 (2020)","journal-title":"Quantum Inf. Process."},{"key":"3958_CR99","doi-asserted-by":"crossref","first-page":"020504","DOI":"10.1103\/PhysRevLett.103.020504","volume":"103","author":"W Wieczorek","year":"2009","unstructured":"Wieczorek, W., Krischek, R., Kiesel, N., Michelberger, P., T\u00f3th, G., Weinfurter, H.: Experimental entanglement of a six-photon symmetric Dicke State. Phys. Rev. Lett. 103, 020504 (2009)","journal-title":"Phys. Rev. Lett."},{"key":"3958_CR100","first-page":"e14641","volume":"6","author":"Y Xie","year":"2014","unstructured":"Xie, Y., Yuan, J., Fujiwara, Y.: Quantum synchronizable codes from augmentation of cyclic codes. PLoS ONE 6, e14641 (2014)","journal-title":"PLoS ONE"},{"key":"3958_CR101","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1109\/LCOMM.2015.2512261","volume":"20","author":"Y Xie","year":"2016","unstructured":"Xie, Y., Yang, L., Yuan, J.: q-ary chain-containing quantum synchronizable codes. IEEE Commun. Lett. 20, 414\u2013417 (2016)","journal-title":"IEEE Commun. Lett."},{"key":"3958_CR102","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1038\/nphoton.2011.354","volume":"6","author":"C Yao","year":"2012","unstructured":"Yao, C., Wang, X., Xu, P., Lu, H., Pan, S., Bao, H., Peng, Z., Lu, Y., Chen, A., Pan, W.: Observation of eight-photon entanglement. Nat. Photon. 6, 225\u2013228 (2012)","journal-title":"Nat. Photon."},{"key":"3958_CR103","volume-title":"Physical layer security in wireless communications","author":"X Zhou","year":"2013","unstructured":"Zhou, X., Song, L., Zhang, Y.: Physical layer security in wireless communications. CRC Press, Inc., USA (2013)"},{"key":"3958_CR104","doi-asserted-by":"crossref","first-page":"5224","DOI":"10.1109\/TIT.2015.2450235","volume":"61","author":"T Zhang","year":"2015","unstructured":"Zhang, T., Ge, G.: Some new classes of quantum MDS codes from constacyclic codes. IEEE Trans. Inf. Theory 61, 5224\u20135228 (2015)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"3958_CR105","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/s10623-016-0245-0","volume":"83","author":"T Zhang","year":"2017","unstructured":"Zhang, T., Ge, G.: Quantum MDS codes with large minimum distance. Des. Codes Cryptogr. 83, 503\u2013517 (2017)","journal-title":"Des. Codes Cryptogr."}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-023-03958-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-023-03958-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-023-03958-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T22:09:12Z","timestamp":1729634952000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-023-03958-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,24]]},"references-count":105,"journal-issue":{"issue":"6","published-online":{"date-parts":[[2023,6]]}},"alternative-id":["3958"],"URL":"https:\/\/doi.org\/10.1007\/s11128-023-03958-7","relation":{},"ISSN":["1573-1332"],"issn-type":[{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,24]]},"assertion":[{"value":"13 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 March 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 June 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}],"article-number":"257"}}