{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T15:12:52Z","timestamp":1729609972755,"version":"3.28.0"},"reference-count":29,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1109\/iscc.2013.6754961","type":"proceedings-article","created":{"date-parts":[[2014,3,7]],"date-time":"2014-03-07T22:14:57Z","timestamp":1394230497000},"page":"000287-000292","source":"Crossref","is-referenced-by-count":1,"title":["A practical viewpoint on the performance of LDPC codes over the fast Rayleigh fading wire-tap channel"],"prefix":"10.1109","author":[{"given":"Marco","family":"Baldi","sequence":"first","affiliation":[]},{"given":"Marco","family":"Bianchi","sequence":"additional","affiliation":[]},{"given":"Nicola","family":"Maturo","sequence":"additional","affiliation":[]},{"given":"Franco","family":"Chiaraluce","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"crossref","first-page":"995","DOI":"10.1109\/GLOCOM.2001.965567","article-title":"Progressive edge-growth Tanner graphs","author":"hu","year":"2001","journal-title":"Proc IEEE Global Telecommunications Conf (GLOBECOM 01)"},{"journal-title":"Principles of Mobile Communication","year":"2011","author":"st?uber","key":"17"},{"key":"18","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1109\/18.485714","article-title":"Iterative decoding of binary block and convolutional codes","volume":"42","author":"hagenauer","year":"1996","journal-title":"IEEE Trans Inform Theory"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2012.2187515"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1109\/WCL.2012.122612.120787"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/CIG.2010.5592833"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/iccw.2011.5963540"},{"key":"11","first-page":"1","article-title":"LDPC codes for physical layer security","author":"klinc","year":"2009","journal-title":"Proc IEEE Global Telecommunications Conference (GLOBECOM 2009)"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2011.2134093"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2161953"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2002.808375"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2012.091212.121230"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2012.030712.100173"},{"key":"24","article-title":"On the generator matrix of array LDPC codes","author":"baldi","year":"2012","journal-title":"Proc SoftCOM 2012"},{"key":"25","first-page":"285","article-title":"Design of permuted serially concatenated multiple paritycheck codes","author":"baldi","year":"2010","journal-title":"Proc SoftCOM 2010"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1109\/EW.2010.5483448"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1109\/TBC.2009.2016498"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.920216"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557609"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.929914"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1978.1055917"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/2463183.2463194"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1975.tb02040.x"},{"key":"7","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1007\/978-3-540-85855-3_17","article-title":"A new analysis of the McEliece cryptosystem based on QC-LDPC codes","volume":"5229","author":"baldi","year":"2008","journal-title":"Lecture Notes in Computer Science"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2009.5351456"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.928990"},{"journal-title":"MDPC-McEliece New McEliece Variants from Moderate Density Parity-check Codes","year":"2012","author":"misoczki","key":"9"},{"key":"8","doi-asserted-by":"crossref","DOI":"10.1049\/iet-ifs.2012.0127","article-title":"Security and complexity of the McEliece cryptosystem based on QCLDPC codes","author":"baldi","year":"2013","journal-title":"IET Information Security"}],"event":{"name":"2013 IEEE Symposium on Computers and Communications (ISCC)","start":{"date-parts":[[2013,7,7]]},"location":"Split, Croatia","end":{"date-parts":[[2013,7,10]]}},"container-title":["2013 IEEE Symposium on Computers and Communications (ISCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6746555\/6754912\/06754961.pdf?arnumber=6754961","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T09:15:23Z","timestamp":1498122923000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6754961\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/iscc.2013.6754961","relation":{},"subject":[],"published":{"date-parts":[[2013,7]]}}}