{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T14:19:45Z","timestamp":1790000385515,"version":"4.0.1"},"reference-count":9,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2018,5,1]],"date-time":"2018-05-01T00:00:00Z","timestamp":1525132800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100005073","name":"Signal Intelligence Research Center supervised by Defense Acquisition Program Administration and Agency for Defense Development of Korea","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100005073","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Commun. Lett."],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1109\/lcomm.2018.2806482","type":"journal-article","created":{"date-parts":[[2018,2,15]],"date-time":"2018-02-15T14:13:45Z","timestamp":1518704025000},"page":"894-897","source":"Crossref","is-referenced-by-count":43,"title":["Blind Reconstruction of BCH Codes Based on Consecutive Roots of Generator Polynomials"],"prefix":"10.1109","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8759-7177","authenticated-orcid":false,"given":"Daemin","family":"Jo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8204-5311","authenticated-orcid":false,"given":"Soonhee","family":"Kwon","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5017-5314","authenticated-orcid":false,"given":"Dong-Joon","family":"Shin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2013.051313.130462"},{"key":"ref3","first-page":"2737","article-title":"Recovering a code’s length and synchronization from a noisy intercepted bitstream","author":"cluzeau","year":"2009","journal-title":"Proc IEEE Int Symp Inf Theory (ISIT)"},{"key":"ref6","first-page":"591","article-title":"Reconstruction of BCH codes using probability compensation","author":"lee","year":"2012","journal-title":"Proc 18th APCC"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.7840\/KICS.2011.36C.10.605"},{"key":"ref8","first-page":"849","article-title":"Blind reconstruction of binary cyclic codes","author":"yardi","year":"2014","journal-title":"Proc Eur Wireless"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/WCSP.2015.7341243"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00353-X"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2016.2525759"},{"key":"ref1","author":"wicker","year":"1995","journal-title":"Error Control Systems for Digital Communication and Storage"}],"container-title":["IEEE Communications Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4234\/8355962\/08292858.pdf?arnumber=8292858","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:11:46Z","timestamp":1641985906000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8292858\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5]]},"references-count":9,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/lcomm.2018.2806482","relation":{},"ISSN":["1089-7798"],"issn-type":[{"value":"1089-7798","type":"print"}],"subject":[],"published":{"date-parts":[[2018,5]]}}}