{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:02:47Z","timestamp":1773378167371,"version":"3.50.1"},"reference-count":15,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"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":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834770","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"2118-2123","source":"Crossref","is-referenced-by-count":2,"title":["Minimum distance and other properties of quasi-dyadic parity check codes"],"prefix":"10.1109","author":[{"given":"Meraiah","family":"Martinez","sequence":"first","affiliation":[{"name":"University of Nebraska – Lincoln,Department of Mathematics,Lincoln,Nebraska,68588"}]},{"given":"Christine A.","family":"Kelley","sequence":"additional","affiliation":[{"name":"University of Nebraska – Lincoln,Department of Mathematics,Lincoln,Nebraska,68588"}]}],"member":"263","reference":[{"key":"ref10","first-page":"179","article-title":"Compact mceliece keys based on quasi-dyadic srivastava codes","volume":"2011","author":"persichetti","year":"2011","journal-title":"IACR Cryptology ePrint Archive"},{"key":"ref11","article-title":"Designing efficient dyadic operations for cryptographic applications","author":"banegas","year":"2018","journal-title":"Cryptology ePrint Archive Report"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25405-5_12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173244"},{"key":"ref14","article-title":"A class of group-structured ldpc codes","author":"tanner","year":"2001"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/18.9772"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-85855-3_17"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2000.866513"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53887-6_29"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620590"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1515\/jmc-2020-0003","article-title":"Reproducible families of codes and cryptographic applications","volume":"16","author":"santini","year":"2022","journal-title":"Journal of Mathematical Cryptology"},{"key":"ref7","first-page":"1","article-title":"On decoding schemes for the mdpc-mceliece cryptosystem","author":"bartz","year":"2019","journal-title":"SCC 2019 12th International ITG Conference on Systems Communications and Coding"},{"key":"ref2","article-title":"Report on Post-Quantum Cryptography","year":"2016","journal-title":"Tech Rep"},{"key":"ref1","first-page":"114","article-title":"A public-key cryptosystem based on algebraic coding theory","volume":"42","author":"mceliece","year":"1978","journal-title":"DSN progress report"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-05445-7_24"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834770.pdf?arnumber=9834770","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:36Z","timestamp":1773347796000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834770\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834770","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}