{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T13:00:19Z","timestamp":1772283619622,"version":"3.50.1"},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2015,9,1]],"date-time":"2015-09-01T00:00:00Z","timestamp":1441065600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11271005"],"award-info":[{"award-number":["11271005"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11171370"],"award-info":[{"award-number":["11171370"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Nanyang Technological University\u2019s Research","award":["M4080456"],"award-info":[{"award-number":["M4080456"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1109\/tit.2015.2451656","type":"journal-article","created":{"date-parts":[[2015,7,10]],"date-time":"2015-07-10T18:55:24Z","timestamp":1436554524000},"page":"4895-4904","source":"Crossref","is-referenced-by-count":20,"title":["Polyadic Constacyclic Codes"],"prefix":"10.1109","volume":"61","author":[{"given":"Bocong","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hai Q.","family":"Dinh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yun","family":"Fan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"San","family":"Ling","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/0378-3758(95)00101-8"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-3758(00)00270-6"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"149","DOI":"10.3233\/FI-1999-381212","article-title":"Enumeration and construction of all duadic codes of length ${\\rm p^{m}}$","volume":"38","author":"ding","year":"1999","journal-title":"Fundam Inform"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.748995"},{"key":"ref12","author":"grassl","year":"2015","journal-title":"Bounds On The Minimum Distance Of Linear Codes And Quantum Codes"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s12190-012-0543-2"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1984.1056944"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847734"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511755279"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.821986"},{"key":"ref19","article-title":"Some special classes of constacyclic codes","author":"liu","year":"2010"},{"key":"ref28","year":"2014","journal-title":"Berlekamp&#x2013;Welch Algorithm"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055088"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(94)90017-5"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011283523000"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2013.05.005"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-013-9865-9"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2008.05.004"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2014.04.006"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(89)90042-5"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557530"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2012.10.001"},{"key":"ref1","volume":"162","author":"alperin","year":"1997","journal-title":"Groups and Representations (Graduate Texts in Mathematics)"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(73)90273-8"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(88)90174-7"},{"key":"ref21","first-page":"225","article-title":"Duadic codes revisited","volume":"59","author":"pless","year":"1987","journal-title":"Congr Numeratium"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2006.12.006"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(91)90049-M"},{"key":"ref26","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-07998-0","author":"van lint","year":"1982","journal-title":"Introduction to Coding Theory"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057300"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7203188\/07154464.pdf?arnumber=7154464","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:02:44Z","timestamp":1642003364000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7154464\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9]]},"references-count":31,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tit.2015.2451656","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9]]}}}