{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T12:04:23Z","timestamp":1725451463024},"reference-count":23,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1109\/apcc.2013.6766003","type":"proceedings-article","created":{"date-parts":[[2014,3,20]],"date-time":"2014-03-20T18:58:42Z","timestamp":1395341922000},"page":"520-524","source":"Crossref","is-referenced-by-count":2,"title":["On some algorithms on the proposed lower bound of the designed minimum distance for cyclic codes"],"prefix":"10.1109","author":[{"given":"Takayasu","family":"Kaida","sequence":"first","affiliation":[]},{"given":"Junru","family":"Zheng","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1109\/ISITA.2010.5649592"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E95.A.2107"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/IWSDA.2007.4408337"},{"key":"23","article-title":"On improvement of proposed algorithm for independent set in cyclic codes\" submitted to","author":"zheng","year":"2013","journal-title":"2013 IEEE Information Theory Workshop"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E93.A.1918"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057134"},{"key":"16","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"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1983.1056672"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/18.212272"},{"journal-title":"A Lower Bound on the Distance of Cyclic Codes","year":"0","author":"ponchio","key":"11"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055915"},{"key":"21","first-page":"441","article-title":"The designed minimum distance of medium lengths for binary cyclic codes","author":"zheng","year":"2012","journal-title":"Proceedings of 2012 International Symposium on Information Theory and Its Applications"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/APCC.2007.4433457"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/IWSDA.2011.6159405"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(72)90887-X"},{"key":"1","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"},{"journal-title":"Error Correcting Codes","year":"1972","author":"peterson","key":"10"},{"journal-title":"The Theory of Error-Correcting Codes","year":"1977","author":"macwilliams","key":"7"},{"key":"6","first-page":"414","article-title":"A note on the proposed lower bound and the hartmann-tzeng bound of the minimum distance for cyclic codes","author":"kaida","year":"2012","journal-title":"Proceedings of the 35th Symposium on Information Theory and Its Applications"},{"key":"5","first-page":"446","article-title":"On improved algorithms of the proposed lower bound including well-known bounds for cyclic codes","author":"kaida","year":"2012","journal-title":"Proceedings of 2012 International Symposium on Information Theory and Its Applications"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/ISITA.2008.4895445"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1515\/9783110811056.155"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1969.1054260"}],"event":{"name":"2013 19th Asia-Pacific Conference on Communications (APCC)","start":{"date-parts":[[2013,8,29]]},"location":"Denpasar, Indonesia","end":{"date-parts":[[2013,8,31]]}},"container-title":["2013 19th Asia-Pacific Conference on Communications (APCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6749272\/6765904\/06766003.pdf?arnumber=6766003","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T19:48:37Z","timestamp":1490298517000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6766003\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,8]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/apcc.2013.6766003","relation":{},"subject":[],"published":{"date-parts":[[2013,8]]}}}