{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:37:20Z","timestamp":1725601040007},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642234897"},{"type":"electronic","value":"9783642234903"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23490-3_34","type":"book-chapter","created":{"date-parts":[[2011,8,17]],"date-time":"2011-08-17T12:35:19Z","timestamp":1313584519000},"page":"366-379","source":"Crossref","is-referenced-by-count":3,"title":["Systematic Construction and Verification Methodology for LDPC Codes"],"prefix":"10.1007","author":[{"given":"Jing","family":"Cui","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yixiang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"crossref","unstructured":"Gallager, R.: Low-density parity-check codes. IRE Trans. Inform. Theory (1962)","DOI":"10.7551\/mitpress\/4347.001.0001"},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"Tanner, R.: A recursive approach to low complexity codes. IEEE Trans. Inform. Theory (1981)","DOI":"10.1109\/TIT.1981.1056404"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"MacKay, D.: Good error-correcting codes based on very sparse matrices. IEEE Trans. Inform. Theory (1999)","DOI":"10.1109\/18.748992"},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"Richardson, T., Shokrollahi, M., Urbanke, R.: Design of capacity approaching irregular low-density parity-check codes. IEEE Trans. Inform. Theory (2001)","DOI":"10.1109\/18.910578"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colonies for the travelling salesman problem. Bio Systems (1997)","DOI":"10.1016\/S0303-2647(97)01708-5"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Wang, X., Huang, W., Wang, S., Zhang, J., Hu, C.: Delay and Capacity Tradeoff Analysis for MotionCast. To Appear in IEEE\/ACM Transactions on Networking\u00a0(99) (2011), doi:10.1109\/TNET.2011.2109042","DOI":"10.1109\/TNET.2011.2109042"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"Wang, X., Bei, Y., Peng, Q., Fu, L.: Speed Improves Delay-Capacity Tradeoff in MotionCast. IEEE Transactions on Parallel and Distributed Systems\u00a0(99) (2011), doi:10.1109\/TPDS.2010.126.","DOI":"10.1109\/TPDS.2010.126"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"Huang, W., Wang, X.: Throughput and Delay Scaling of General Cognitive Networks. In: Proc. of IEEE INFOCOM 2011, Shanghai, China (2011)","DOI":"10.1109\/INFCOM.2011.5935035"},{"key":"34_CR9","doi-asserted-by":"crossref","unstructured":"Falcao, G., Silva, V., Sousa, L.: How GPUs can outperform ASICs for fast LDPC decoding. In: Proc. International Conf. on Supercomputing (2009)","DOI":"10.1145\/1542275.1542330"},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"Marchand, C., Dore, J., Canencia, L., Boutillon, E.: Conflict resolution for pipelined layered LDPC decoders. In: IEEE Workshop on SiPS (2009)","DOI":"10.1109\/SIPS.2009.5336255"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"Vukobratovic, D., Senk, V.: Generalized ACE constrained progressive Eedge-growth LDPC code design. IEEE Comm. Letters (2008)","DOI":"10.1109\/LCOMM.2008.071457"},{"key":"34_CR12","unstructured":"Hu, Y., Eleftheriou, E., Arnold, D.M.: Regular and irregular progressive edge growth Tanner graphs. IEEE Trans. Inform. Theory (2005)"},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"Blanksby, A.J., Howland, C.J.: A 690-mW 1-Gb\/s 1024-b, rate-1\/2 low-density parity-check code decoder. J. Solid-State Circuits (2002)","DOI":"10.1109\/4.987093"},{"key":"34_CR14","unstructured":"Cui, Z., Wang, Z., Liu, Y.: High-throughput layered LDPC decoding architecture. IEEE Trans. VLSI Syst. (2009)"},{"key":"34_CR15","doi-asserted-by":"crossref","unstructured":"Hocevar, D.E.: A reduced complexity decoder architecture via layered decoding of LDPC codes. In: IEEE Workshop on SiPS (2004)","DOI":"10.1109\/SIPS.2004.1363033"},{"key":"34_CR16","unstructured":"Chen, J., Tanner, R.M., Jones, C., Yan Li, L.: Improved min-sum decoding algorithms for irregular LDPC codes. In: Proc. ISIT (2005)"},{"key":"34_CR17","unstructured":"IEEE Standard for Local and Metropolitan Area Networks Part 16, IEEE Standard 802.16e (2008)"},{"key":"34_CR18","unstructured":"http:\/\/en.wikipedia.org\/wiki\/Simulated_annealing"}],"container-title":["Lecture Notes in Computer Science","Wireless Algorithms, Systems, and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23490-3_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T03:53:57Z","timestamp":1560484437000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23490-3_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642234897","9783642234903"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23490-3_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}