{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T22:05:18Z","timestamp":1751839518728,"version":"3.37.3"},"reference-count":13,"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\/501100002881","name":"Key Projects of Natural Science from Fundamental Research for the Central Universities of the Civil Aviation University of China","doi-asserted-by":"publisher","award":["3122019192"],"award-info":[{"award-number":["3122019192"]}],"id":[{"id":"10.13039\/501100002881","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.3010534","type":"journal-article","created":{"date-parts":[[2020,7,20]],"date-time":"2020-07-20T21:22:31Z","timestamp":1595280151000},"page":"134219-134223","source":"Crossref","is-referenced-by-count":1,"title":["Constructions of Polynomial Codes Based on Circular Permutation Over Finite Fields"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1991-2352","authenticated-orcid":false,"given":"Xiuli","family":"Wang","sequence":"first","affiliation":[{"name":"College of Science, Civil Aviation University of China, Tianjin, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yakun","family":"Hao","sequence":"additional","affiliation":[{"name":"College of Science, Civil Aviation University of China, Tianjin, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Qiao","sequence":"additional","affiliation":[{"name":"College of Science, Civil Aviation University of China, Tianjin, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2017.2766140"},{"journal-title":"Linear Code Bound (On-Line Server)","year":"2020","author":"brouwer","key":"ref11"},{"journal-title":"Introductory Combinatorics","year":"2004","author":"brualdi","key":"ref12"},{"journal-title":"Finite Fields","year":"1993","author":"lidl","key":"ref13"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1006\/ffta.2000.0305"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.868488"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/S1071-5797(03)00042-X"},{"key":"ref5","first-page":"51","article-title":"Construction of A class of linear codes with good parameters","volume":"31","author":"li","year":"2003","journal-title":"Chin J Electron"},{"key":"ref8","first-page":"572","article-title":"Construction of a family of p-ary opitimal linear codes and low correlation linear sequences","volume":"42","author":"tang","year":"2014","journal-title":"Chin J Electron"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/11596981_11"},{"key":"ref2","first-page":"153","article-title":"A class of extended codes of generalized R-S codes over Fq","volume":"10","author":"xu","year":"2008","journal-title":"Journal of Chongqing University of Science and Technology"},{"journal-title":"The Theory of Error-Correcting Codes","year":"1977","author":"macwilliams","key":"ref1"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ffa.2017.08.001"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09144565.pdf?arnumber=9144565","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T19:57:21Z","timestamp":1662667041000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9144565\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3010534","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2020]]}}}