{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:41:59Z","timestamp":1740148919974,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"11-12","license":[{"start":{"date-parts":[[2017,8,25]],"date-time":"2017-08-25T00:00:00Z","timestamp":1503619200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann. Telecommun."],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s12243-017-0606-3","type":"journal-article","created":{"date-parts":[[2017,8,25]],"date-time":"2017-08-25T02:08:46Z","timestamp":1503626926000},"page":"653-660","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Erasure correction-based CSMA\/CA"],"prefix":"10.1007","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9945-5328","authenticated-orcid":false,"given":"Patrick","family":"Tortelier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Didier","family":"Le Ruyet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,8,25]]},"reference":[{"issue":"9","key":"606_CR1","doi-asserted-by":"crossref","first-page":"1360","DOI":"10.1109\/5.317082","volume":"82","author":"N Abramson","year":"1994","unstructured":"Abramson N (1994) Multiple access in wireless digital networks. Proc IEEE 82(9):1360\u20131370","journal-title":"Proc IEEE"},{"issue":"4","key":"606_CR2","doi-asserted-by":"crossref","first-page":"1408","DOI":"10.1109\/TWC.2007.348337","volume":"6","author":"E Cassini","year":"2007","unstructured":"Cassini E, Gaudenzi RD, del Rio Herrero O (2007) Contention resolution diversity slotted ALOHA (CRDSA): an enhanced random access scheme for satellite access packet networks. IEEE Trans Wirel Commun 6 (4):1408\u20131419","journal-title":"IEEE Trans Wirel Commun"},{"issue":"2","key":"606_CR3","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1109\/TCOMM.2010.120710.100054","volume":"59","author":"G Liva","year":"2011","unstructured":"Liva G (2011) Graph-based analysis and optimization of contention resolution diversity slotted ALOHA. IEEE Trans Commun 59(2):477\u2013487","journal-title":"IEEE Trans Commun"},{"key":"606_CR4","doi-asserted-by":"crossref","unstructured":"Paolini E, Liva G, Chiani M (2011) High throughput random access via codes on graphs: coded slotted ALOHA. In: Proceedings of 2011 IEEE international conference communications (ICC), pp 1\u20136","DOI":"10.1109\/icc.2011.5962871"},{"key":"606_CR5","doi-asserted-by":"crossref","unstructured":"Stockhammer T, Shokrollahi A, Watson M, Luby M, Gasiba T (2009) Application layer forward error correction for mobile multimedia broadcasting, Digital Fountain, Tech. Rep. 80-D9741-1 Rev. A","DOI":"10.1201\/9781420053890-10"},{"issue":"8","key":"606_CR6","doi-asserted-by":"crossref","first-page":"1528","DOI":"10.1109\/JSAC.2002.803996","volume":"20","author":"J Byers","year":"2002","unstructured":"Byers J, Luby M, Mitzenmacher M (2002) A digital fountain approach to asynchronous reliable multicast. IEEE J on Selected Areas in Communications (JSAC) 20(8):1528\u20131540","journal-title":"IEEE J on Selected Areas in Communications (JSAC)"},{"key":"606_CR7","doi-asserted-by":"crossref","unstructured":"Chong Z, Goi B, Ohsaki H, Ng C, Ewe H (2012) Design of short-length message Fountain code for erasure channel transmission. In: IEEE conference sustainable utilization and development in engineering and technology (STUDENT), pp 239\u2013241","DOI":"10.1109\/STUDENT.2012.6408411"},{"key":"606_CR8","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1002\/1098-2418(200010\/12)17:3\/4<197::AID-RSA2>3.0.CO;2-K","volume":"17","author":"C Cooper","year":"2000","unstructured":"Cooper C (2000) On the distribution of rank of a random matrix over a finite field. Random Structures and Algorithms 17:197\u2013 212","journal-title":"Random Structures and Algorithms"},{"issue":"4","key":"606_CR9","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1007\/s00453-008-9192-0","volume":"56","author":"C Studholme","year":"2010","unstructured":"Studholme C, Blake I (2010) Random matrices and codes for the erasure channel. Algorithmica 56 (4):605\u2013620","journal-title":"Algorithmica"},{"issue":"3","key":"606_CR10","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1109\/49.840210","volume":"18","author":"G Bianchi","year":"2000","unstructured":"Bianchi G (2000) Performance analysis of the IEEE 802.11 distributed coordination function. IEEE J on Selected Areas in Communications (JSAC) 18(3):535\u2013547","journal-title":"IEEE J on Selected Areas in Communications (JSAC)"},{"key":"606_CR11","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1137\/0108018","volume":"8","author":"I Reed","year":"1960","unstructured":"Reed I, Solomon G (1960) Polynomial codes over certain finite fields. J Soc Indust Appl Math 8:300\u2013304","journal-title":"J Soc Indust Appl Math"},{"key":"606_CR12","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511807077","volume-title":"Fundamentals of error correcting codes","author":"W Huffman","year":"2003","unstructured":"Huffman W, Pless V (2003) Fundamentals of error correcting codes. Cambridge University Press, Cambridge"},{"issue":"3","key":"606_CR13","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1109\/TIT.2004.824918","volume":"50","author":"H Pishro-Nik","year":"2004","unstructured":"Pishro-Nik H, Fekri F (2004) On decoding of low-density parity-check codes over the binary erasure channel. IEEE Trans Inf Theory 50(3):439\u2013454","journal-title":"IEEE Trans Inf Theory"},{"issue":"11","key":"606_CR14","doi-asserted-by":"crossref","first-page":"2837","DOI":"10.1109\/TIT.2004.836694","volume":"50","author":"D Burshtein","year":"2004","unstructured":"Burshtein D, Miller G (2004) An efficient maximum likelihood decoding of LDPC codes over the binary erasure channel. IEEE Trans Inf Theory 50(11):2837\u20132844","journal-title":"IEEE Trans Inf Theory"},{"key":"606_CR15","unstructured":"Kumar D, Chahed T, Altman E (2009) Analysis of a Fountain code based transport in an 802.11 WLAN cell. In: Proceedings of the IEEE International Teletraffic Congress"},{"key":"606_CR16","unstructured":"Moln\u00e1r S, M\u00f3cz\u00e1r Z, Temesv\u00e1ry A, Sonkoly B, Solymos S, Csiscsics T (2013) Data transfer paradigms for future networks: Fountain coding or congestion control?. In: Proceedings of the IFIP NETWORKING"}],"container-title":["Annals of Telecommunications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12243-017-0606-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12243-017-0606-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12243-017-0606-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T16:07:18Z","timestamp":1570032438000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12243-017-0606-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,25]]},"references-count":16,"journal-issue":{"issue":"11-12","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["606"],"URL":"https:\/\/doi.org\/10.1007\/s12243-017-0606-3","relation":{},"ISSN":["0003-4347","1958-9395"],"issn-type":[{"type":"print","value":"0003-4347"},{"type":"electronic","value":"1958-9395"}],"subject":[],"published":{"date-parts":[[2017,8,25]]}}}