{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T08:06:55Z","timestamp":1729670815240,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1109\/isit.2005.1523290","type":"proceedings-article","created":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T15:51:59Z","timestamp":1160581919000},"page":"47-51","source":"Crossref","is-referenced-by-count":1,"title":["Upper bounds on the rate of LDPC codes as a function of minimum distance"],"prefix":"10.1109","author":[{"given":"Y.","family":"Ben-Haim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Litsyn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2003.1228137"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1977.1055688"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.828064"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.820012"},{"journal-title":"The Theory of Error-Correcting Codes","year":"1977","author":"macwilliams","key":"12"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.801408"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523290"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1109\/18.782101"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1109\/18.992777"},{"key":"7","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low Density Parity Check Codes"},{"key":"6","article-title":"Weight distribution of iterative coding systems: How deviant can you be?","author":"di","year":"2001","journal-title":"Book ISIT2001 Washington D C"},{"journal-title":"Asymptotic and finite length analysis of low-density parity-check codes","year":"2004","author":"di","key":"5"},{"key":"4","first-page":"1","article-title":"An algebraic approach to the association schemes of coding theory","volume":"10","author":"delsarte","year":"1973","journal-title":"Philips Res Repts Suppl"},{"key":"9","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1090\/dimacs\/056\/16","volume":"56","year":"2001","journal-title":"DIMACS Ser Discrete Math Theor Comput Sci"},{"key":"8","article-title":"Survey of binary Krawtchouk polynomials","author":"krasikov","year":"1999","journal-title":"Book Codes and Association Schemes"}],"event":{"name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","start":{"date-parts":[[2005,9,4]]},"location":"Adelaide, Australia","end":{"date-parts":[[2005,9,9]]}},"container-title":["Proceedings. International Symposium on Information Theory, 2005. ISIT 2005."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/10215\/32581\/01523290.pdf?arnumber=1523290","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T16:42:40Z","timestamp":1555864960000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1523290\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/isit.2005.1523290","relation":{},"subject":[],"published":{"date-parts":[[2005]]}}}