{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:08:53Z","timestamp":1725548933265},"reference-count":19,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/isit.2018.8437501","type":"proceedings-article","created":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T20:14:55Z","timestamp":1534536895000},"page":"2505-2509","source":"Crossref","is-referenced-by-count":3,"title":["Bounds and Constructions of Codes over Symbol-Pair Read Channels"],"prefix":"10.1109","author":[{"given":"Ohad","family":"Elishco","sequence":"first","affiliation":[]},{"given":"Ryan","family":"Gabrys","sequence":"additional","affiliation":[]},{"given":"Eitan","family":"Yaakobi","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511807077"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2481889"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10623-016-0271-y"},{"key":"ref13","first-page":"681","article-title":"Error-trapping decoding for cyclic codes over symbol-pair read channels","author":"morii","year":"2016","journal-title":"Inter Symp Inform Theory Its Appl"},{"key":"ref14","first-page":"116","article-title":"The symbol-pair distance distribution of a class of repeated-root cyclic codes over Fpm","author":"sun","year":"2017","journal-title":"Cryp and Comm"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E98.A.2415"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E99.A.2179"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E100.A.2578"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2522434"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-71045-7_6"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2276615"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033982"},{"key":"ref6","article-title":"On the symbol-pair distance of repeated-root constacyclic codes of prime power lengths","author":"dinh","year":"2017","journal-title":"IEEE Trans Inform Theory"},{"key":"ref5","first-page":"1","article-title":"New constructions of MDS symbol-pair codes","author":"ding","year":"2017","journal-title":"Des Codes Cryptogr"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2014.6970813"},{"journal-title":"Notes on Coding Theory","year":"2013","author":"hall","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2164891"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1986.1057242"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E99.A.2170"}],"event":{"name":"2018 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2018,6,17]]},"location":"Vail, CO, USA","end":{"date-parts":[[2018,6,22]]}},"container-title":["2018 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8410646\/8437120\/08437501.pdf?arnumber=8437501","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T04:10:10Z","timestamp":1598242210000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8437501\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":19,"URL":"https:\/\/doi.org\/10.1109\/isit.2018.8437501","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}