{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:36:50Z","timestamp":1775018210345,"version":"3.50.1"},"reference-count":19,"publisher":"Pleiades Publishing Ltd","issue":"4","license":[{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,1]],"date-time":"2024-12-01T00:00:00Z","timestamp":1733011200000},"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":["Probl Inf Transm"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1134\/s0032946024040021","type":"journal-article","created":{"date-parts":[[2025,2,1]],"date-time":"2025-02-01T13:42:51Z","timestamp":1738417371000},"page":"291-303","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Transformation Preserving the Dimension and Minimum Weight of Cyclic Codes"],"prefix":"10.1134","volume":"60","author":[{"given":"Ryul","family":"Kim","sequence":"first","affiliation":[]},{"given":"Un Ye","family":"Kim","sequence":"additional","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2025,2,1]]},"reference":[{"issue":"8","key":"5106_CR1","doi-asserted-by":"publisher","first-page":"1293","DOI":"10.1109\/LCOMM.2019.2921330","volume":"23","author":"D. Liao","year":"2019","unstructured":"Liao, D., Kai, X., Zhu, S., and Li, P., A Class of Optimal Cyclic Codes with Two Zeros, IEEE Commun. Lett., 2019, vol.\u00a023, no.\u00a08, pp.\u00a01293\u20131296. https:\/\/doi.org\/10.1109\/LCOMM.2019.2921330","journal-title":"IEEE Commun. Lett."},{"issue":"9","key":"5106_CR2","doi-asserted-by":"publisher","first-page":"5898","DOI":"10.1109\/TIT.2013.2260795","volume":"59","author":"C. Ding","year":"2013","unstructured":"Ding, C. and Helleseth, T., Optimal Ternary Cyclic Codes from Monomials, IEEE Trans. Inform. Theory, 2013, vol.\u00a059, no.\u00a09, pp.\u00a05898\u20135904. https:\/\/doi.org\/10.1109\/TIT.2013.2260795","journal-title":"IEEE Trans. Inform. Theory"},{"key":"5106_CR3","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/j.ffa.2015.10.004","volume":"37","author":"C. Fan","year":"2016","unstructured":"Fan, C., Li, N., and Zhou, Z., A Class of Optimal Ternary Cyclic Codes and Their Duals, Finite Fields Appl., 2016, vol.\u00a037, pp.\u00a0193\u2013202. https:\/\/doi.org\/10.1016\/j.ffa.2015.10.004","journal-title":"Finite Fields Appl."},{"issue":"3","key":"5106_CR4","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1049\/cje.2020.02.011","volume":"29","author":"J. Fan","year":"2020","unstructured":"Fan, J. and Zhang, Y., Optimal Quinary Cyclic Codes with Minimum Distance Four, Chin. J. Electron., 2020, vol.\u00a029, no.\u00a03, pp.\u00a0515\u2013524. https:\/\/doi.org\/10.1049\/cje.2020.02.011","journal-title":"Chin. J. Electron."},{"key":"5106_CR5","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.ffa.2019.07.002","volume":"59","author":"D. Han","year":"2019","unstructured":"Han, D. and Yan, H., On an Open Problem about a Class of Optimal Ternary Cyclic Codes, Finite Fields Appl., 2019, vol.\u00a059, pp.\u00a0335\u2013343. https:\/\/doi.org\/10.1016\/j.ffa.2019.07.002","journal-title":"Finite Fields Appl."},{"key":"5106_CR6","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.ffa.2014.06.001","volume":"30","author":"N. Li","year":"2014","unstructured":"Li, N., Li, C., Helleseth, T., Ding, C., and Tang, X.H., Optimal Ternary Cyclic Codes with Minimum Distance Four and Five, Finite Fields Appl., 2014, vol.\u00a030, pp.\u00a0100\u2013120. https:\/\/doi.org\/10.1016\/j.ffa.2014.06.001","journal-title":"Finite Fields Appl."},{"key":"5106_CR7","doi-asserted-by":"crossref","unstructured":"Li, N., Zhou, Z., and Helleseth, T., On a Conjecture about a Class of Optimal Ternary Cyclic Codes, in 7th Int. Workshop on Signal Design and Its Applications in Communications (IWDSA 2015), Bengaluru, India, Sept.\u00a014\u201318, 2015, pp.\u00a062\u201365. https:\/\/doi.org\/10.1109\/IWSDA.2015.7458415","DOI":"10.1109\/IWSDA.2015.7458415"},{"issue":"7","key":"5106_CR8","doi-asserted-by":"publisher","first-page":"1387","DOI":"10.1109\/LCOMM.2020.2983373","volume":"24","author":"Y. Liu","year":"2020","unstructured":"Liu, Y. and Cao, X., Four Classes of Optimal Quinary Cyclic Codes, IEEE Commun. Lett., 2020, vol.\u00a024, no.\u00a07, pp.\u00a01387\u20131390. https:\/\/doi.org\/10.1109\/LCOMM.2020.2983373","journal-title":"IEEE Commun. Lett."},{"issue":"2","key":"5106_CR9","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s10623-019-00679-w","volume":"88","author":"Y. Liu","year":"2020","unstructured":"Liu, Y., Cao, X., and Lu, W., On Some Conjectures about Optimal Ternary Cyclic Codes, Des. Codes Crypogr., 2020, vol.\u00a088, no.\u00a02, pp.\u00a0297\u2013309. https:\/\/doi.org\/10.1007\/s10623-019-00679-w","journal-title":"Des. Codes Crypogr."},{"issue":"4","key":"5106_CR10","doi-asserted-by":"publisher","first-page":"979","DOI":"10.3934\/amc.2021033","volume":"17","author":"Y. Liu","year":"2023","unstructured":"Liu, Y., Cao, X., and Lu, W., Two Classes of New Optimal Ternary Cyclic Codes, Adv. Math. Commun., 2023, vol.\u00a017, no.\u00a04, pp.\u00a0979\u2013993. https:\/\/doi.org\/10.3934\/amc.2021033","journal-title":"Adv. Math. Commun."},{"key":"5106_CR11","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.ffa.2016.03.007","volume":"40","author":"L. Wang","year":"2016","unstructured":"Wang, L. and Wu, G., Several Classes of Optimal Ternary Cyclic Codes with Minimal Distance Four, Finite Fields Appl., 2016, vol.\u00a040, pp.\u00a0126\u2013137. https:\/\/doi.org\/10.1016\/j.ffa.2016.03.007","journal-title":"Finite Fields Appl."},{"issue":"4","key":"5106_CR12","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s12095-015-0159-0","volume":"8","author":"G. Xu","year":"2016","unstructured":"Xu, G., Cao, X., and Xu, S., Optimal $p$-ary Cyclic Codes with Minimum Distance Four from Monomials, Cryptogr. Commun., 2016, vol.\u00a08, no.\u00a04, pp.\u00a0541\u2013554. https:\/\/doi.org\/10.1007\/s12095-015-0159-0","journal-title":"Cryptogr. Commun."},{"key":"5106_CR13","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/j.ffa.2018.08.004","volume":"54","author":"H. Yan","year":"2018","unstructured":"Yan, H., Zhou, Z., and Du, X., A Family of Optimal Ternary Cyclic Codes from the Niho-Type Exponent, Finite Fields Appl., 2018, vol.\u00a054, pp.\u00a0101\u2013112. https:\/\/doi.org\/10.1016\/j.ffa.2018.08.004","journal-title":"Finite Fields Appl."},{"key":"5106_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2020.101671","volume":"64","author":"Z. Zha","year":"2020","unstructured":"Zha, Z. and Hu, L., New Classes of Optimal Ternary Cyclic Codes with Minimum Distance Four, Finite Fields Appl., 2020, vol.\u00a064, Article No.\u00a0101671 (16\u00a0pp.). https:\/\/doi.org\/10.1016\/j.ffa.2020.101671","journal-title":"Finite Fields Appl."},{"key":"5106_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2021.101898","volume":"75","author":"Z. Zha","year":"2021","unstructured":"Zha, Z., Hu, L., Liu, Y., and Cao, X., Further Results on Optimal Ternary Cyclic Codes, Finite Fields Appl., 2021, vol.\u00a075, Article No.\u00a0101898. https:\/\/doi.org\/10.1016\/j.ffa.2021.101898","journal-title":"Finite Fields Appl."},{"key":"5106_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2022.101995","volume":"79","author":"H. Zhao","year":"2022","unstructured":"Zhao, H., Luo, R., and Sun, T., Two Families of Optimal Ternary Cyclic Codes with Minimal Distance Four, Finite Fields Appl., 2022, vol.\u00a079, Article No.\u00a0101995. https:\/\/doi.org\/10.1016\/j.ffa.2022.101995","journal-title":"Finite Fields Appl."},{"key":"5106_CR17","doi-asserted-by":"crossref","unstructured":"Lidl, R. and Niederreiter, H., Finite Fields, Cambridge: Cambridge Univ. Press, 1997, 2nd ed.","DOI":"10.1017\/CBO9780511525926"},{"issue":"3","key":"5106_CR18","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1016\/j.ffa.2006.03.002","volume":"13","author":"R.W. Fitzgerald","year":"2007","unstructured":"Fitzgerald, R.W. and Yucas, J.L., Generalized Reciprocals, Factors of Dickson Polynomials and Generalized Cyclotomic Polynomials over Finite Fields, Finite Fields Appl., 2007, vol.\u00a013, no.\u00a03, pp.\u00a0492\u2013515. https:\/\/doi.org\/10.1016\/j.ffa.2006.03.002","journal-title":"Finite Fields Appl."},{"key":"5106_CR19","doi-asserted-by":"crossref","unstructured":"Huffman, W.C. and Pless, V., Fundamentals of Error-Correcting Codes, Cambridge: Cambridge Univ. Press, 2003.","DOI":"10.1017\/CBO9780511807077"}],"container-title":["Problems of Information Transmission"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946024040021.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0032946024040021","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0032946024040021.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T02:51:01Z","timestamp":1775011861000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0032946024040021"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["5106"],"URL":"https:\/\/doi.org\/10.1134\/s0032946024040021","relation":{},"ISSN":["0032-9460","1608-3253"],"issn-type":[{"value":"0032-9460","type":"print"},{"value":"1608-3253","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12]]},"assertion":[{"value":"11 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 July 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 December 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors of this work declare that they have no conflicts of interest.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}}]}}