{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T06:57:12Z","timestamp":1781074632714,"version":"3.54.1"},"reference-count":21,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100002842","name":"Chiang Mai University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002842","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.2974866","type":"journal-article","created":{"date-parts":[[2020,2,18]],"date-time":"2020-02-18T21:33:43Z","timestamp":1582061623000},"page":"39946-39958","source":"Crossref","is-referenced-by-count":9,"title":["On the Hamming Distance of Repeated-Root Cyclic Codes of Length 6<i>p<sup>s<\/sup>\n                  <\/i>"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6487-8803","authenticated-orcid":false,"given":"Hai Q.","family":"Dinh","sequence":"first","affiliation":[{"name":"Division of Computational Mathematics and Engineering, Institute for Computational Science, Ton Duc Thang University, Ho Chi Minh City, Vietnam"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7717-6133","authenticated-orcid":false,"given":"Xiaoqiang","family":"Wang","sequence":"additional","affiliation":[{"name":"Hubei Key Laboratory of Applied Mathematics, Faculty of Mathematics and Statistics, Hubei University, Wuhan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3794-6161","authenticated-orcid":false,"given":"Paravee","family":"Maneejuk","sequence":"additional","affiliation":[{"name":"Centre of Excellence in Econometrics, Faculty of Economics, Chiang Mai University, Chiang Mai, Thailand"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2016.08.005"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2012.10.002"},{"key":"ref13","author":"macwilliams","year":"1998","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.811921"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1054936"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1007\/978-3-642-02181-7_10","article-title":"The minimum Hamming distance of cyclic codes of length 2ps","volume":"5527","author":"\u00f6zadam","year":"2009","journal-title":"Applied Algebra Algebraic Algorithms and Error-Correcting Codes"},{"key":"ref17","author":"pless","year":"1998","journal-title":"Handbook of Coding Theory"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2016.04.001"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2007.07.001"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2014.11.006"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2013.01.024"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2011.07.003"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/609\/12150"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1142\/S1793557113500204"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2014.05.046"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.75249"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.disc.2019.01.023"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/18.556131"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/18.75250"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09001011.pdf?arnumber=9001011","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T19:55:13Z","timestamp":1662666913000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9001011\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/access.2020.2974866","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}