{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:30:25Z","timestamp":1743082225758,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642047718"},{"type":"electronic","value":"9783642047725"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04772-5_61","type":"book-chapter","created":{"date-parts":[[2009,9,23]],"date-time":"2009-09-23T16:32:44Z","timestamp":1253723564000},"page":"469-476","source":"Crossref","is-referenced-by-count":0,"title":["Simulation Based Optimization of Vertex Packing Decoding Algorithms"],"prefix":"10.1007","author":[{"given":"Michael","family":"Lunglmayr","sequence":"first","affiliation":[]},{"given":"Jens","family":"Berkmann","sequence":"additional","affiliation":[]},{"given":"Mario","family":"Huemer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"61_CR1","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4347.001.0001","volume-title":"Low-Density Parity-Check Codes","author":"R.G. Gallager","year":"1963","unstructured":"Gallager, R.G.: Low-Density Parity-Check Codes. MIT Press, Cambridge (1963)"},{"key":"61_CR2","unstructured":"Joint Proposal: High throughput extension to the 802.11 Standard: PHY. IEEE 802.11-05\/1102r4 (2006)"},{"issue":"3","key":"61_CR3","doi-asserted-by":"publisher","first-page":"954","DOI":"10.1109\/TIT.2004.842696","volume":"51","author":"F. Kschischang","year":"2005","unstructured":"Kschischang, F., Frey, B., Loeliger, H.: Factor graphs and the sum-product algorithm. IEEE Transactions on Information Theory\u00a051(3), 954\u2013972 (2005)","journal-title":"IEEE Transactions on Information Theory"},{"key":"61_CR4","doi-asserted-by":"crossref","unstructured":"Chung, S.Y., Forney, G.D., Richardson, T.J., Urbanke, R.: On the Design of Low-Density Parity-Check Codes within 0.0045 dB of the Shannon Limit. IEEE Communications Letters\u00a05(2) (2001)","DOI":"10.1109\/4234.905935"},{"issue":"6","key":"61_CR5","doi-asserted-by":"publisher","first-page":"2173","DOI":"10.1109\/18.782170","volume":"45","author":"T. Etzion","year":"1999","unstructured":"Etzion, T., Trachtenberg, A., Vardy, A.: Which Codes Have Cycle-Free Tanner Graphs. IEEE Transactions on Information Theory\u00a045(6), 2173\u20132181 (1999)","journal-title":"IEEE Transactions on Information Theory"},{"key":"61_CR6","doi-asserted-by":"crossref","unstructured":"Lunglmayr, M., Berkmann, J., Huemer, M.: Vertex Packing Decoding. In: Proc. International Conference on Communications (ICC), Dresden, Germany (2009)","DOI":"10.1109\/ICC.2009.5199565"},{"issue":"1","key":"61_CR7","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/BF01580444","volume":"8","author":"G. Nemhauser","year":"1975","unstructured":"Nemhauser, G., Trotter, L.: Vertex Packings: Structural Properties and Algorithms. Mathematical Programming\u00a08(1), 232\u2013248 (1975)","journal-title":"Mathematical Programming"},{"key":"61_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07807-5","volume-title":"How to Solve It: Modern Heuristics","author":"Z. Michalewicz","year":"2004","unstructured":"Michalewicz, Z., Fogel, D.: How to Solve It: Modern Heuristics, 2nd edn. Springer, Heidelberg (2004)","edition":"2"},{"key":"61_CR9","volume-title":"Channel Coding for Telecommunications","author":"M. Bossert","year":"1999","unstructured":"Bossert, M.: Channel Coding for Telecommunications. Wiley, Chichester (1999)"},{"key":"61_CR10","unstructured":"MacKay, D.: Encyclopedia of Sparse Graph Codes (hypertext archive), http:\/\/www.inference.phy.cam.ac.uk\/mackay\/codes\/data.html"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Systems Theory - EUROCAST 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04772-5_61","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T16:16:39Z","timestamp":1558541799000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04772-5_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642047718","9783642047725"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04772-5_61","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}