{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:49:40Z","timestamp":1725472180168},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1109\/iwsda.2017.8097081","type":"proceedings-article","created":{"date-parts":[[2017,11,28]],"date-time":"2017-11-28T11:03:58Z","timestamp":1511867038000},"page":"178-181","source":"Crossref","is-referenced-by-count":0,"title":["On the consecutive sets of defining sequence for lower bounds on cyclic codes"],"prefix":"10.1109","author":[{"given":"Junru","family":"Zheng","sequence":"first","affiliation":[]},{"given":"Takayasu","family":"Kaida","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1515\/9783110811056.155"},{"journal-title":"Error Correcting Codes","year":"1972","author":"peterson","key":"ref11"},{"journal-title":"A lower bound on the distance of cyclic codes” BCRI Preprint","year":"2003","author":"ponchio","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057134"},{"key":"ref14","article-title":"On linear complexity and minimum distance for cyclic codes by defining sequence with unknown elements","author":"zheng","year":"2005","journal-title":"The Second International Workshop on Sequence Design and its Application in Communication CD-ROM"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/IWSDA.2007.4408337"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E93.A.1918"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISITA.2010.5649592"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/IWSDA.2011.6159405"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E95.A.2107"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(72)90887-X"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/18.212272"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/APCC.2013.6766003"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055178"},{"journal-title":"The Theory of Error-Correcting Codes","year":"1977","author":"macwilliams","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056672"},{"journal-title":"A theory for distance bounding cyclic codes” BCRI-CGC-Preprint","year":"2007","author":"betti","key":"ref2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/18.508853"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1969.1054260"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/IWSDA.2013.6849055"},{"key":"ref21","first-page":"542","article-title":"On the Reciprocal Property of the Defining Set for Cyclic Codes","author":"zheng","year":"2016","journal-title":"Proceedings of 2016 International Symposium on Information Theory and its Applications"}],"event":{"name":"2017 Eighth International Workshop on Signal Design and its Applications in Communications (IWSDA)","start":{"date-parts":[[2017,9,24]]},"location":"Sapporo","end":{"date-parts":[[2017,9,28]]}},"container-title":["2017 Eighth International Workshop on Signal Design and Its Applications in Communications (IWSDA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8086158\/8095724\/08097081.pdf?arnumber=8097081","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,12,13]],"date-time":"2017-12-13T14:38:24Z","timestamp":1513175904000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8097081\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/iwsda.2017.8097081","relation":{},"subject":[],"published":{"date-parts":[[2017,9]]}}}