{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T13:36:45Z","timestamp":1773409005175,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,8,13]],"date-time":"2012-08-13T00:00:00Z","timestamp":1344816000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,8,13]]},"DOI":"10.1145\/2342356.2342363","type":"proceedings-article","created":{"date-parts":[[2012,8,14]],"date-time":"2012-08-14T12:18:56Z","timestamp":1344946736000},"page":"49-60","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":95,"title":["Spinal codes"],"prefix":"10.1145","author":[{"given":"Jonathan","family":"Perry","sequence":"first","affiliation":[{"name":"M.I.T., Cambridge, MA, USA"}]},{"given":"Peter A.","family":"Iannucci","sequence":"additional","affiliation":[{"name":"M.I.T., Cambridge, MA, USA"}]},{"given":"Kermin E.","family":"Fleming","sequence":"additional","affiliation":[{"name":"M.I.T., Cambridge, MA, USA"}]},{"given":"Hari","family":"Balakrishnan","sequence":"additional","affiliation":[{"name":"M.I.T., Cambridge, MA, USA"}]},{"given":"Devavrat","family":"Shah","sequence":"additional","affiliation":[{"name":"M.I.T., Cambridge, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,8,13]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1984.1096023"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1974.1055186"},{"key":"e_1_3_2_2_3_1","volume-title":"June","author":"Balakrishnan H.","year":"2012","unstructured":"H. Balakrishnan , P. Iannucci , J. Perry , and D. Shah . De-randomizing Shannon: The Design and Analysis of a Capacity-Achieving Rateless Code. arXiv:1206.0418 , June 2012 . H. Balakrishnan, P. Iannucci, J. Perry, and D. Shah. De-randomizing Shannon: The Design and Analysis of a Capacity-Achieving Rateless Code. arXiv:1206.0418, June 2012."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1856821.1856930"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-68351-3_8"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1993.397441"},{"key":"e_1_3_2_2_7_1","volume-title":"Bit-Rate Selection in Wireless Networks. Master's thesis","author":"Bicket J.","year":"2005","unstructured":"J. Bicket . Bit-Rate Selection in Wireless Networks. Master's thesis , Massachusetts Institute of Technology , Feb. 2005 . J. Bicket. Bit-Rate Selection in Wireless Networks. Master's thesis, Massachusetts Institute of Technology, Feb. 2005."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173242"},{"key":"e_1_3_2_2_9_1","volume-title":"ISIT","author":"Etesami O.","year":"2005","unstructured":"O. Etesami , M. Molkaraie , and A. Shokrollahi . Raptor codes on symmetric channels . In ISIT , 2005 . O. Etesami, M. Molkaraie, and A. Shokrollahi. Raptor codes on symmetric channels. In ISIT, 2005."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/7693.975452"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018455"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.836667"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851203"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/381677.381700"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2348543.2348549"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.136.0675"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378600.1378615"},{"key":"e_1_3_2_2_19_1","unstructured":"IEEE Std 802.11n-2009: Enhancements for Higher Throughput.  IEEE Std 802.11n-2009: Enhancements for Higher Throughput."},{"key":"e_1_3_2_2_20_1","volume-title":"Int. Conf. on Comm., Internet, and Info. Tech.","author":"Li J.","year":"2002","unstructured":"J. Li and K. Narayanan . Rate-compatible low density parity check codes for capacity-approaching ARQ scheme in packet data communications . In Int. Conf. on Comm., Internet, and Info. Tech. , 2002 . J. Li and K. Narayanan. Rate-compatible low density parity check codes for capacity-approaching ARQ scheme in packet data communications. In Int. Conf. on Comm., Internet, and Info. Tech., 2002."},{"key":"e_1_3_2_2_21_1","volume-title":"FOCS","author":"Luby M.","year":"2003","unstructured":"M. Luby . LT codes . In FOCS , 2003 . M. Luby. LT codes. In FOCS, 2003."},{"key":"e_1_3_2_2_22_1","volume-title":"Oct.","author":"Luby M.","year":"2007","unstructured":"M. Luby , A. Shokrollahi , M. Watson , and T. Stockhammer . Raptor Forward Error Correction Scheme for Object Delivery. RFC 5053 (Proposed Standard) , Oct. 2007 . M. Luby, A. Shokrollahi, M. Watson, and T. Stockhammer. Raptor Forward Error Correction Scheme for Object Delivery. RFC 5053 (Proposed Standard), Oct. 2007."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.1999.831721"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and computing: Randomized algorithms and probabilistic analysis","author":"Mitzenmacher M.","year":"2005","unstructured":"M. Mitzenmacher and E. Upfal . Probability and computing: Randomized algorithms and probabilistic analysis , chapter 13, pages 321 -- 326 . Cambridge University Press , 2005 . M. Mitzenmacher and E. Upfal. Probability and computing: Randomized algorithms and probabilistic analysis, chapter 13, pages 321--326. Cambridge University Press, 2005."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1872007.1872013"},{"key":"e_1_3_2_2_26_1","volume-title":"ISIT","author":"Palanki R.","year":"2005","unstructured":"R. Palanki and J. Yedidia . Rateless codes on noisy channels . In ISIT , 2005 . R. Palanki and J. Yedidia. Rateless codes on noisy channels. In ISIT, 2005."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2070562.2070568"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.44582"},{"key":"e_1_3_2_2_29_1","volume-title":"SPIE's 47th Meeting","author":"Schurgers C.","year":"2001","unstructured":"C. Schurgers and M. B. Srivastava . A Systematic Approach to Peak-to-Average Power Ratio in OFDM . In SPIE's 47th Meeting , 2001 . C. Schurgers and M. B. Srivastava. A Systematic Approach to Peak-to-Average Power Ratio in OFDM. In SPIE's 47th Meeting, 2001."},{"key":"e_1_3_2_2_30_1","volume-title":"NSDI","author":"Sen S.","year":"2010","unstructured":"S. Sen , N. Santhapuri , R. Choudhury , and S. Nelakuditi . AccuRate: Constellation-based rate estimation in wireless networks . NSDI , 2010 . S. Sen, N. Santhapuri, R. Choudhury, and S. Nelakuditi. AccuRate: Constellation-based rate estimation in wireless networks. NSDI, 2010."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.833022"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/JRPROC.1949.232969"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874390"},{"key":"e_1_3_2_2_35_1","article-title":"Incremental redundancy hybrid ARQ with LDPC and Raptor codes","author":"Soljanin E.","year":"2005","unstructured":"E. Soljanin , N. Varnica , and P. Whiting . Incremental redundancy hybrid ARQ with LDPC and Raptor codes . IEEE Trans. Info. Theory , 2005 . E. Soljanin, N. Varnica, and P. Whiting. Incremental redundancy hybrid ARQ with LDPC and Raptor codes. IEEE Trans. Info. Theory, 2005.","journal-title":"IEEE Trans. Info. Theory"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1002\/ett.4460100604"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1982.1056454"},{"key":"e_1_3_2_2_38_1","volume-title":"ISIT","author":"Ungerboeck G.","year":"1976","unstructured":"G. Ungerboeck and I. Csajka . On improving data-link performance by increasing the channel alphabet and introducing sequence coding . In ISIT , 1976 . G. Ungerboeck and I. Csajka. On improving data-link performance by increasing the channel alphabet and introducing sequence coding. In ISIT, 1976."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2007.158"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1967.1054010"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592571"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.5555\/554634"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1161089.1161107"}],"event":{"name":"SIGCOMM '12: ACM SIGCOMM 2012 Conference","location":"Helsinki Finland","acronym":"SIGCOMM '12","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2342356.2342363","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2342356.2342363","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:21:01Z","timestamp":1750238461000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2342356.2342363"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,8,13]]},"references-count":42,"alternative-id":["10.1145\/2342356.2342363","10.1145\/2342356"],"URL":"https:\/\/doi.org\/10.1145\/2342356.2342363","relation":{},"subject":[],"published":{"date-parts":[[2012,8,13]]},"assertion":[{"value":"2012-08-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}