{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T17:05:31Z","timestamp":1730221531698,"version":"3.28.0"},"reference-count":37,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"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":[[2019,9]]},"DOI":"10.1109\/ewdts.2019.8884427","type":"proceedings-article","created":{"date-parts":[[2019,11,5]],"date-time":"2019-11-05T11:34:05Z","timestamp":1572953645000},"page":"1-5","source":"Crossref","is-referenced-by-count":0,"title":["Construction of Length and Rate Adaptive MET QC-LDPC Codes by Cyclic Group Decomposition"],"prefix":"10.1109","author":[{"given":"Usatyuk","family":"Vasiliy","sequence":"first","affiliation":[]},{"given":"Egorov","family":"Sergey","sequence":"additional","affiliation":[]},{"given":"German","family":"Svistunov","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","first-page":"113","article-title":"Evaluation of Gallager codes for short block length and high rate applications","author":"mackay","year":"0","journal-title":"Proc IMA Workshop on Codes Systems and Graphical Models 1999"},{"key":"ref32","article-title":"The General Sieve Kernel and New Records in Lattice Reduction","author":"albrecht","year":"0","journal-title":"Cryptology ePrint Archive Report"},{"key":"ref31","article-title":"Parallel Implementation of BDD Enumeration for LWE","volume":"9696","author":"kirshanova","year":"0","journal-title":"ACNS 2016 Lecture Notes in Computer Science"},{"key":"ref30","article-title":"Estimation of the Success Probability of Random Sampling by the Gram-Charlier Approximation","author":"yoshitatsu","year":"0","journal-title":"Cryptology ePrint Archive Report 2018\/457 2018"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2014.03.003"},{"journal-title":"Constructed codes (girth EMD)and code distance optimization","year":"0","author":"usatyuk","key":"ref36"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2253152"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173244"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.831841"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394825"},{"key":"ref12","first-page":"449","article-title":"Improved min-sum decoding algorithms for irregular LDPC codes","author":"chen","year":"0","journal-title":"IEEE Int Symp Inform Theory"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/MILCOM.2005.1606100"},{"key":"ref14","first-page":"2305","article-title":"Extension of quasi-cyclic LDPC codes by lifting","author":"myung","year":"0","journal-title":"Proc Int Symp Inform Theory"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/EWDTS.2018.8524862"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.8441303"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-37634-7_13"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1287\/moor.12.3.415","article-title":"Minkowski convex body theorem and integer programming","volume":"12","author":"karman","year":"1987","journal-title":"Mathematics of Operations Research"},{"key":"ref19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2016-7","author":"conway","year":"1988","journal-title":"Sphere Packings Lattices and Groups"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/11792086_17"},{"key":"ref4","article-title":"Multi-edge type LDPC codes","author":"richardson","year":"2002","journal-title":"presented at the Workshop honoring Prof Bob McEliece on his 60th birthday California Institute of Technology"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/3-540-36494-3_14","article-title":"Lattice Reduction by Random Sampling and Birthday Methods","author":"schnorr","year":"2003","journal-title":"STACS Lecture Notes in Comp Sci"},{"key":"ref3","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-60693-9_13","article-title":"Good codes based on very sparse matri-ces","author":"mackay","year":"1995","journal-title":"Cryptography and Coding Lect Notes in Comp Science"},{"journal-title":"3GPP TS38 212V15 4 0 NR Multiplexing and channel coding(Rel 15)","year":"0","key":"ref6"},{"key":"ref29","article-title":"Random Sampling Revisited: Lattice Enumeration with Discrete Pruning","author":"yoshinori","year":"0","journal-title":"Cryptology Rep 2017\/155"},{"key":"ref5","first-page":"1","article-title":"Analysis of Circular Buffer Rate Matching for LTE Turbo Code","author":"chenget","year":"2008","journal-title":"The IEEE 68th Vehicular Technology Conference"},{"journal-title":"CCSDS 131 0-B-3 Standard","year":"2017","key":"ref8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TBC.2016.2515538"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056404"},{"journal-title":"IEEE P802 3ca 50G-EPON","first-page":"23","year":"2017","key":"ref9"},{"key":"ref1","article-title":"Low-Density Parity-Check Codes","author":"gallager","year":"1963","journal-title":"Cambridge"},{"key":"ref20","first-page":"594","volume":"818","author":"betten","year":"2006","journal-title":"Error-Correcting Linear Codes Classification by Isometry and Applications"},{"key":"ref22","first-page":"55","article-title":"Parallel algorithms for integer lattices basis reduction","volume":"1","author":"usatyuk","year":"2015","journal-title":"Software&systems"},{"key":"ref21","article-title":"Creating a Challenge for Ideal Lattices","author":"plantard","year":"0","journal-title":"IACR Cryptology Rep 2013\/039"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1985-0777278-8"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808749"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/BF01457454"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548300001371"}],"event":{"name":"2019 IEEE East-West Design & Test Symposium (EWDTS)","start":{"date-parts":[[2019,9,13]]},"location":"Batumi, Georgia","end":{"date-parts":[[2019,9,16]]}},"container-title":["2019 IEEE East-West Design & Test Symposium (EWDTS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8871308\/8884369\/08884427.pdf?arnumber=8884427","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T15:25:22Z","timestamp":1658157922000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8884427\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":37,"URL":"https:\/\/doi.org\/10.1109\/ewdts.2019.8884427","relation":{},"subject":[],"published":{"date-parts":[[2019,9]]}}}