iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://api.crossref.org/works/10.1016/J.DSP.2012.11.012
{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T23:03:05Z","timestamp":1698102185709},"reference-count":14,"publisher":"Elsevier BV","issue":"3","content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Digital Signal Processing"],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1016\/j.dsp.2012.11.012","type":"journal-article","created":{"date-parts":[[2012,12,1]],"date-time":"2012-12-01T18:47:24Z","timestamp":1354387644000},"page":"994-1001","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":3,"title":["Designing parity check matrix to achieve linear encoding time in LDPC codes"],"prefix":"10.1016","volume":"23","author":[{"given":"Honey Durga","family":"Tiwari","sequence":"first","affiliation":[]},{"given":"Harsh Durga","family":"Tiwari","sequence":"additional","affiliation":[]},{"given":"Kang-Yoon","family":"Lee","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.dsp.2012.11.012_br0010","series-title":"Low-Density Parity-Check Codes","author":"Gallager","year":"1963"},{"key":"10.1016\/j.dsp.2012.11.012_br0020","doi-asserted-by":"crossref","first-page":"1645","DOI":"10.1049\/el:19961141","article-title":"Near Shannon limit performance of low density parity check codes","volume":"32","author":"MacKay","year":"1996","journal-title":"Electron. Lett."},{"key":"10.1016\/j.dsp.2012.11.012_br0030","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1109\/18.910577","article-title":"Design of capacity-approaching low density parity-check codes","volume":"47","author":"Richardson","year":"2001","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"10.1016\/j.dsp.2012.11.012_br0040","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1109\/18.748992","article-title":"Good error-correcting codes based on very sparse matrices","volume":"45","author":"MacKay","year":"1999","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"6","key":"10.1016\/j.dsp.2012.11.012_br0050","doi-asserted-by":"crossref","first-page":"1570","DOI":"10.1109\/TIT.2002.1003839","article-title":"Finite length analysis of low-density parity-check codes on the binary erasure channel","volume":"48","author":"Di","year":"2002","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.dsp.2012.11.012_br0060","series-title":"Proc. MFCSIT2002","article-title":"Weaknesses of Margulis and Ramanujan\u2013Margulis low-density parity-check codes","volume":"vol. 74","author":"MacKay","year":"2003"},{"key":"10.1016\/j.dsp.2012.11.012_br0070","unstructured":"T. Richardson, Error floors of LDPC codes, in: Proceedings of 42nd Allerton Conference on Communication, Control and Computing, Monticello, IL, 2004, pp. 1426\u20131435."},{"key":"10.1016\/j.dsp.2012.11.012_br0080","unstructured":"M.G. Luby, M. Mitzenmacher, M.A. Shokrollahi, D.A. Spielman, Improved low-density parity-check codes using irregular graphs and belief propagation, in: Proc. ISIT98, 1998, pp. 16\u201321."},{"key":"10.1016\/j.dsp.2012.11.012_br0090","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1109\/18.910579","article-title":"Efficient encoding of low-density parity-check codes","volume":"47","author":"Richardson","year":"2001","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.dsp.2012.11.012_br0100","series-title":"Matrix Mathematics: Theory, Facts, and Formulas","author":"Bernstein","year":"2009"},{"key":"10.1016\/j.dsp.2012.11.012_br0110","doi-asserted-by":"crossref","unstructured":"Z. Li, L. Chen, L. Zeng, S. Lin, W. Fong, Efficient encoding of quasi-cyclic low density parity-check codes, in: Proc. IEEE Globecom, 2005, pp. 1205\u20131210.","DOI":"10.1109\/TCOMM.2005.858628"},{"issue":"11","key":"10.1016\/j.dsp.2012.11.012_br0120","doi-asserted-by":"crossref","first-page":"2711","DOI":"10.1109\/18.959255","article-title":"Low-density parity-check codes based on finite geometries: A rediscovery and new results","volume":"47","author":"Kou","year":"2001","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/j.dsp.2012.11.012_br0130","doi-asserted-by":"crossref","unstructured":"L. Miles, J. Gambles, G. Maki, W. Ryan, S. Whitaker, An (8158,7136) low density parity-check encoder, in: Proc. IEEE Conf. Custom Integr. Circuits, 2005, pp. 699\u2013702.","DOI":"10.1109\/JSSC.2006.877253"},{"issue":"10","key":"10.1016\/j.dsp.2012.11.012_br0140","doi-asserted-by":"crossref","first-page":"2240","DOI":"10.1109\/TCSI.2007.904641","article-title":"A versatile variable rate LDPC codec architecture","volume":"54","author":"Fewer","year":"2007","journal-title":"IEEE Trans. Circuits Syst. I. Regul. Pap."}],"container-title":["Digital Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1051200412002813?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1051200412002813?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,7,6]],"date-time":"2019-07-06T05:35:52Z","timestamp":1562391352000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1051200412002813"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5]]},"references-count":14,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["S1051200412002813"],"URL":"http:\/\/dx.doi.org\/10.1016\/j.dsp.2012.11.012","relation":{},"ISSN":["1051-2004"],"issn-type":[{"value":"1051-2004","type":"print"}],"subject":[],"published":{"date-parts":[[2013,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Designing parity check matrix to achieve linear encoding time in LDPC codes","name":"articletitle","label":"Article Title"},{"value":"Digital Signal Processing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.dsp.2012.11.012","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2012 Elsevier Inc. All rights reserved.","name":"copyright","label":"Copyright"}]}}