{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T10:15:03Z","timestamp":1730283303900,"version":"3.28.0"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T00:00:00Z","timestamp":1638144000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T00:00:00Z","timestamp":1638144000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T00:00:00Z","timestamp":1638144000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021,11,29]]},"DOI":"10.1109\/milcom52596.2021.9652992","type":"proceedings-article","created":{"date-parts":[[2021,12,30]],"date-time":"2021-12-30T21:06:10Z","timestamp":1640898370000},"page":"7-12","source":"Crossref","is-referenced-by-count":0,"title":["Mitigating Blind Detection Through Protograph Based Interleaving for Turbo Codes"],"prefix":"10.1109","author":[{"given":"Stefan","family":"Weithoffer","sequence":"first","affiliation":[]},{"given":"Rami","family":"Klaimi","sequence":"additional","affiliation":[]},{"given":"Charbel Abdel","family":"Nour","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"2003","article-title":"Reconstruction of a turbo-code interleaver from noisy observation","author":"c\u00f4te","year":"0","journal-title":"IEEE Int Symp on Inf Theory"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513365"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875341"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/SPIS.2015.7422336"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1049\/ip-com:20050086"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISTEL.2010.5734027"},{"key":"ref16","first-page":"153","article-title":"Joint channel-security coding based on interleaver and puncturer in turbo code","author":"chen","year":"0","journal-title":"2011 3rd Symposium on Web Society"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2017.2783971"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.839478"},{"key":"ref19","article-title":"Distance Upper Bounds and True Minimum Distance Results for Turbo-Codes Designed with DRP Interleavers","author":"crozier","year":"2003","journal-title":"Proc 3rd Int Symp on Turbo Codes & Related Topics"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2463678"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1984.tb00072.x"},{"key":"ref6","first-page":"113","article-title":"Algebraic approach for the reconstruction of linear and convolutional error correcting codes","volume":"2","author":"barbier","year":"2006","journal-title":"Intern J Applied Math and Comp Sci"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(00)00353-X"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261971"},{"key":"ref7","article-title":"Overview of turbo-code reconstruction techniques","volume":"68","author":"barbier","year":"2009","journal-title":"IACR Cryptol ePrint Arch"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1975.tb02040.x"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595063"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2016.1500284WC"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2004.1312507"},{"key":"ref22","first-page":"151","article-title":"Improving Turbo Codes for 5G with parity puncture-constrained interleavers","author":"garz\u00f3n-boh\u00f3rquez","year":"0","journal-title":"Int Symp Turbo Codes Relat Topics"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/LWC.2014.2367517"},{"key":"ref24","first-page":"3","article-title":"Lexicographically ordered permutations","author":"skiena","year":"1990","journal-title":"Implementing Discrete Mathematics Combinatorics and Graph Theory with Mathematica"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/18.904537"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC45663.2020.9120779"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1049\/el.2012.4433"}],"event":{"name":"MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)","start":{"date-parts":[[2021,11,29]]},"location":"San Diego, CA, USA","end":{"date-parts":[[2021,12,2]]}},"container-title":["MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9652874\/9652880\/09652992.pdf?arnumber=9652992","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T17:00:04Z","timestamp":1652202004000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9652992\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,29]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/milcom52596.2021.9652992","relation":{},"subject":[],"published":{"date-parts":[[2021,11,29]]}}}