{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:45:23Z","timestamp":1740123923578,"version":"3.37.3"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,11,12]],"date-time":"2018-11-12T00:00:00Z","timestamp":1541980800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Telecommun Syst"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s11235-018-0524-3","type":"journal-article","created":{"date-parts":[[2018,11,12]],"date-time":"2018-11-12T04:51:31Z","timestamp":1541998291000},"page":"205-214","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Overhead minimization of online codes"],"prefix":"10.1007","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5995-4787","authenticated-orcid":false,"given":"Hassan","family":"Tavakoli","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,11,12]]},"reference":[{"key":"524_CR1","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/4347.001.0001","volume-title":"Low-density parity-check codes","author":"RG Gallager","year":"1963","unstructured":"Gallager, R. G. (1963). Low-density parity-check codes. Cambridge, MA: MIT Press."},{"key":"524_CR2","doi-asserted-by":"publisher","unstructured":"Karami, A. R., Ahmadian Attari, M., & Tavakoli, H. (2009). Multi layer perceptron neural networks decoder for LDPC codes. In 2009 5th international conference on wireless communications, networking and mobile computing, Beijing, 2009 (pp. 1\u20134). \n                    https:\/\/doi.org\/10.1109\/wicom.2009.5303382\n                    \n                  .","DOI":"10.1109\/wicom.2009.5303382"},{"key":"524_CR3","doi-asserted-by":"publisher","unstructured":"Tavakoli, H., Attari, M. A., & Peyghami, M. R. (2011). Optimal rate for irregular LDPC codes in binary erasure channel. In Information theory workshop (ITW), 2011 IEEE, Paraty, 2011 (pp. 125\u2013129). \n                    https:\/\/doi.org\/10.1109\/itw.2011.6089360\n                    \n                  .","DOI":"10.1109\/itw.2011.6089360"},{"key":"524_CR4","doi-asserted-by":"publisher","unstructured":"Tavakoli, H., Attari, M. A., & Peyghami, M. R. (2011). Optimal rate and maximum erasure probability LDPC codes in binary erasure channel. In 2011 49th annual Allerton conference on communication, control, and computing (Allerton), Monticello, IL, 2011. \n                    https:\/\/doi.org\/10.1109\/allerton.2011.6163054\n                    \n                  .","DOI":"10.1109\/allerton.2011.6163054"},{"issue":"13","key":"524_CR5","doi-asserted-by":"publisher","first-page":"2000","DOI":"10.1049\/iet-com.2011.0915","volume":"6","author":"H Tavakoli","year":"2012","unstructured":"Tavakoli, H., Ahmadian, M., & Peyghami, M. R. (2012). Optimal rate irregular low-density parity-check codes in binary erasure channel. IET Communications,\n                           6(13), 2000\u20132006. \n                    https:\/\/doi.org\/10.1049\/iet-com.2011.0915\n                    \n                  .","journal-title":"IET Communications"},{"key":"524_CR6","doi-asserted-by":"publisher","unstructured":"Tavakoli, H. (2014). Reducing the complexity of the linear programming decoding. In 2014 7th international symposium on telecommunications (IST), Tehran, 2014 (pp. 582\u2013584). \n                    https:\/\/doi.org\/10.1109\/istel.2014.7000772\n                    \n                  .","DOI":"10.1109\/istel.2014.7000772"},{"key":"524_CR7","doi-asserted-by":"publisher","unstructured":"Tavakoli, H. (2014). Source and channel optimal rate LDPC code design for one sender in BE-MAC with source correlation, In 2014 7th international symposium on telecommunications (IST), Tehran (pp. 578\u2013581). \n                    https:\/\/doi.org\/10.1109\/istel.2014.7000771\n                    \n                  .","DOI":"10.1109\/istel.2014.7000771"},{"key":"524_CR8","doi-asserted-by":"publisher","unstructured":"Tavakoli, H. (2014). A fast convergence density evolution algorithm for optimal rate LDPC codes in BEC. In: 2014 7th international symposium on telecommunications (IST), Tehran (pp. 574\u2013577). \n                    https:\/\/doi.org\/10.1109\/istel.2014.7000770\n                    \n                  .","DOI":"10.1109\/istel.2014.7000770"},{"key":"524_CR9","unstructured":"Tavakoli, H., & Razi, A. (2016). Optimizing low density parity check code for two parallel erasure links. In 2016 international symposium on information theory and its applications (ISITA), Monterey, CA (pp. 394\u2013397)."},{"key":"524_CR10","doi-asserted-by":"crossref","unstructured":"Tavakoli, H. (2017). A family of LDPC codes for Binary Symmetric Channel with optimized rate. In 2017 Iranian Conference on Electrical Engineering (ICEE), Tehran, 2017 (pp. 1774\u20131778).","DOI":"10.1109\/IranianCEE.2017.7985338"},{"key":"524_CR11","doi-asserted-by":"crossref","unstructured":"Luby, M., Mitzenmacher, M., Shokrollahi, A., Spielman D., & Stemann, V. (1997). Practical loss-resilient codes. In Proceedings of the 29th annual ACM symposium on theory of computing (pp. 150\u2013169), May 1997.","DOI":"10.1145\/258533.258573"},{"key":"524_CR12","doi-asserted-by":"publisher","first-page":"3017","DOI":"10.1109\/TIT.2002.805067","volume":"48","author":"P Oswald","year":"2002","unstructured":"Oswald, P., & Shokrollahi, A. (2002). Capacity-achieving sequences for the erausre channel. IEEE Transactions on Information Theory,\n                           48, 3017\u20133028.","journal-title":"IEEE Transactions on Information Theory"},{"key":"524_CR13","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1109\/4234.905935","volume":"5","author":"S-Y Chung","year":"2001","unstructured":"Chung, S.-Y., Forney, G., Richardson, T., & Urbanke, R. (2001). On the design of low-density parity check codes within 0.0045 db of the Shannon Limit. IEEE Communications Letters,\n                           5, 58\u201360.","journal-title":"IEEE Communications Letters"},{"key":"524_CR14","doi-asserted-by":"publisher","unstructured":"Luby, M. (2002). LT codes. In Foundations of computer science, 2002. Proceedings. The 43rd annual IEEE symposium on (pp. 271\u2013280). \n                    https:\/\/doi.org\/10.1109\/sfcs.2002.1181950\n                    \n                  .","DOI":"10.1109\/sfcs.2002.1181950"},{"key":"524_CR15","doi-asserted-by":"crossref","unstructured":"Ebrahimzadeh, F., Attari, M. A., & Tavakoli, H. (2017). Extended LT decoder based on extra ripples. In 2017 Iranian conference on electrical engineering (ICEE), Tehran, 2017 (pp. 1735\u20131740).","DOI":"10.1109\/IranianCEE.2017.7985330"},{"issue":"6","key":"524_CR16","doi-asserted-by":"publisher","first-page":"2551","DOI":"10.1109\/TIT.2006.874390","volume":"52","author":"A Shokrollahi","year":"2006","unstructured":"Shokrollahi, A. (2006). Raptor codes. IEEE Transactions on Information Theory,\n                           52(6), 2551\u20132567.","journal-title":"IEEE Transactions on Information Theory"},{"key":"524_CR17","unstructured":"Shokrollahi, A., Lassen, S., & Luby, M. (2001). Multi-stage code generator and decoder for communication systems. U.S. Patent application number 20030058958, Dec 2001."},{"issue":"9","key":"524_CR18","doi-asserted-by":"publisher","first-page":"5322","DOI":"10.1109\/TIT.2014.2334315","volume":"60","author":"S Yang","year":"2014","unstructured":"Yang, S., & Yeung, R. W. (2014). Batched sparse codes. IEEE Transactions on Information Theory,\n                           60(9), 5322\u20135346.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"524_CR19","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1109\/JSAC.2015.2504281","volume":"34","author":"F L\u00e1zaro","year":"2016","unstructured":"L\u00e1zaro, F., Paolini, E., Liva, G., & Bauch, G. (2016). Distance spectrum of fixed-rate raptor codes with linear random precoders. IEEE Journal on Selected Areas in Communications,\n                           34(2), 422\u2013436.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"10","key":"524_CR20","first-page":"4114","volume":"65","author":"F L\u00e1zaro","year":"2017","unstructured":"L\u00e1zaro, F., Liva, G., & Bauch, G. (2017). Inactivation decoding of LT and raptor codes: analysis and code design. IEEE Transactions on Communications,\n                           65(10), 4114\u20134127.","journal-title":"IEEE Transactions on Communications"},{"key":"524_CR21","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.comcom.2014.04.010","volume":"49","author":"A Talari","year":"2014","unstructured":"Talari, A., & Rahnavard, N. (2014). Robust LT codes with alternating feedback. Computer Communications,\n                           49, 60\u201368.","journal-title":"Computer Communications"},{"key":"524_CR22","unstructured":"Maymounkov, P., & Mazieres, D. (2003). Rateless codes and big downloads. In International workshop on peer-to-peer systems (pp. 247\u2013255). Berlin: Springer."},{"key":"524_CR23","unstructured":"Maymounkov, P. (2002). Online codes. Technical report, New York University."},{"issue":"4","key":"524_CR24","doi-asserted-by":"publisher","first-page":"769","DOI":"10.1287\/moor.23.4.769","volume":"23","author":"A Ben-Tal","year":"1998","unstructured":"Ben-Tal, A., & Nemirovski, A. (1998). Robust convex optimization. Mathematics of Operations Research,\n                           23(4), 769\u2013805.","journal-title":"Mathematics of Operations Research"}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-018-0524-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11235-018-0524-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-018-0524-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,11]],"date-time":"2019-11-11T19:35:32Z","timestamp":1573500932000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11235-018-0524-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,12]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["524"],"URL":"https:\/\/doi.org\/10.1007\/s11235-018-0524-3","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"type":"print","value":"1018-4864"},{"type":"electronic","value":"1572-9451"}],"subject":[],"published":{"date-parts":[[2018,11,12]]},"assertion":[{"value":"12 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}