{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T08:28:48Z","timestamp":1729672128165,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1109\/isit.2015.7282788","type":"proceedings-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T18:09:52Z","timestamp":1443722992000},"page":"1911-1915","source":"Crossref","is-referenced-by-count":3,"title":["Parallel encoding algorithm for LDPC codes based on block-diagonalization"],"prefix":"10.1109","author":[{"given":"Takayuki","family":"Nozaki","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6034185"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec\/e89-a.10.2510"},{"key":"ref10","first-page":"1479","article-title":"PaToH (partitioning tool for hypergraphs)","author":"\u00e7ataly\u00fcrek","year":"2011","journal-title":"Encyclopedia of Parallel Computing"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1109\/71.780863","article-title":"Hypergraph-partitioning-based decomposition for parallel sparse-matrix vector multiplication","volume":"10","author":"\u00e7ataly\u00fcrek","year":"1999","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827502401953"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E97.A.1556"},{"article-title":"Encyclopedia of sparse graph codes","year":"0","author":"mackay","key":"ref12"},{"key":"ref8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-92106-2","author":"lengauer","year":"1990","journal-title":"Combinatorial Algorithms for Integrated Circuit Layout"},{"journal-title":"Hypergraphs North Holland Mathematical Library","year":"1989","author":"berge","key":"ref7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/18.910579"},{"key":"ref9","article-title":"Hypergraph models for sparse matrix partitioning and reordering","author":"\u00e7ataly\u00fcrek","year":"1999","journal-title":"Computer Engineering and Information Science Bilkent University"},{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","author":"gallager","year":"1963","journal-title":"Low Density Parity Check Codes"}],"event":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","start":{"date-parts":[[2015,6,14]]},"location":"Hong Kong, Hong Kong","end":{"date-parts":[[2015,6,19]]}},"container-title":["2015 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7270906\/7282397\/07282788.pdf?arnumber=7282788","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,8]],"date-time":"2020-09-08T23:24:24Z","timestamp":1599607464000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7282788\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/isit.2015.7282788","relation":{},"subject":[],"published":{"date-parts":[[2015,6]]}}}