{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T02:08:09Z","timestamp":1725502089022},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1109\/iwsda.2015.7458409","type":"proceedings-article","created":{"date-parts":[[2016,4,25]],"date-time":"2016-04-25T17:45:12Z","timestamp":1461606312000},"page":"38-41","source":"Crossref","is-referenced-by-count":0,"title":["The computational complexity of some algorithms for the rank bounded distance on cyclic codes"],"prefix":"10.1109","author":[{"given":"Junru","family":"Zheng","sequence":"first","affiliation":[]},{"given":"Takayasu","family":"Kaiday","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E93.A.1918"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISITA.2010.5649592"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/IWSDA.2011.6159405"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E95.A.2107"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/IWSDA.2013.6849055"},{"key":"ref15","first-page":"338","article-title":"On Modification of Rank Bound by Matrix Manipulation for Cyclic Codes","author":"zheng","year":"0"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E98.A.2476"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/APCC.2013.6766003"},{"key":"ref3","first-page":"446","article-title":"On improved algorithms of the proposed lower bound including well-known bounds for cyclic codes","author":"kaida","year":"0"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1515\/9783110811056.155"},{"key":"ref5","article-title":"A note on the rank bounded distance and its algorithms for cyclic codes","author":"kaida","year":"2015","journal-title":"Abridging over Troubled Water Scientific Foundation of Engineering Subjects"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057134"},{"key":"ref7","article-title":"A lower bound on the distance of cyclic codes","author":"ponchio","year":"0","journal-title":"BCRI Preprint 2003 the file of BCRI-07 ps on"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.212272"},{"key":"ref1","article-title":"A theory for distance bounding cyclic codes","author":"betti","year":"0","journal-title":"BCR I-CGC-Preprint 2007 the File of BCRI-63 pdf on"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/IWSDA.2007.4408337"}],"event":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","start":{"date-parts":[[2015,9,14]]},"location":"Bengaluru, India","end":{"date-parts":[[2015,9,18]]}},"container-title":["2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7452893\/7458374\/07458409.pdf?arnumber=7458409","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,17]],"date-time":"2017-03-17T12:48:45Z","timestamp":1489754925000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7458409\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/iwsda.2015.7458409","relation":{},"subject":[],"published":{"date-parts":[[2015,9]]}}}