{"id":"https://openalex.org/W2293181060","doi":"https://doi.org/10.1145/2342356.2342363","title":"Spinal codes","display_name":"Spinal codes","publication_year":2012,"publication_date":"2012-08-13","ids":{"openalex":"https://openalex.org/W2293181060","doi":"https://doi.org/10.1145/2342356.2342363","mag":"2293181060"},"language":"en","primary_location":{"id":"doi:10.1145/2342356.2342363","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2342356.2342363","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086553872","display_name":"Jonathan Perry","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Jonathan Perry","raw_affiliation_strings":["M.I.T., Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"M.I.T., Cambridge, MA, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006623868","display_name":"Peter A. Iannucci","orcid":"https://orcid.org/0000-0002-6465-7023"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Peter A. Iannucci","raw_affiliation_strings":["M.I.T., Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"M.I.T., Cambridge, MA, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027505039","display_name":"Kermin Fleming","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kermin E. Fleming","raw_affiliation_strings":["M.I.T., Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"M.I.T., Cambridge, MA, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5113516878","display_name":"Hari Balakrishnan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hari Balakrishnan","raw_affiliation_strings":["M.I.T., Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"M.I.T., Cambridge, MA, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029499294","display_name":"Devavrat Shah","orcid":"https://orcid.org/0000-0003-0737-3259"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Devavrat Shah","raw_affiliation_strings":["M.I.T., Cambridge, MA, USA"],"affiliations":[{"raw_affiliation_string":"M.I.T., Cambridge, MA, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5086553872"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":16.8852,"has_fulltext":false,"cited_by_count":133,"citation_normalized_percentile":{"value":0.99358659,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"49","last_page":"60"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10148","display_name":"Advanced MIMO Systems Optimization","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7604819536209106},{"id":"https://openalex.org/keywords/additive-white-gaussian-noise","display_name":"Additive white Gaussian noise","score":0.5503260493278503},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.501089334487915},{"id":"https://openalex.org/keywords/low-density-parity-check-code","display_name":"Low-density parity-check code","score":0.4867711067199707},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.47072353959083557},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.4554166793823242},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.4527483582496643},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.4523051083087921},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.44902902841567993},{"id":"https://openalex.org/keywords/fountain-code","display_name":"Fountain code","score":0.425266295671463},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.4020195007324219},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.3472899794578552},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.29715174436569214}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7604819536209106},{"id":"https://openalex.org/C169334058","wikidata":"https://www.wikidata.org/wiki/Q353292","display_name":"Additive white Gaussian noise","level":3,"score":0.5503260493278503},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.501089334487915},{"id":"https://openalex.org/C67692717","wikidata":"https://www.wikidata.org/wiki/Q187444","display_name":"Low-density parity-check code","level":3,"score":0.4867711067199707},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.47072353959083557},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.4554166793823242},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.4527483582496643},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.4523051083087921},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.44902902841567993},{"id":"https://openalex.org/C76132124","wikidata":"https://www.wikidata.org/wiki/Q5474786","display_name":"Fountain code","level":5,"score":0.425266295671463},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.4020195007324219},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3472899794578552},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.29715174436569214},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2342356.2342363","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2342356.2342363","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":49,"referenced_works":["https://openalex.org/W168388083","https://openalex.org/W1496108277","https://openalex.org/W1518716055","https://openalex.org/W1570163350","https://openalex.org/W1595409123","https://openalex.org/W1751486617","https://openalex.org/W1981300870","https://openalex.org/W1984103088","https://openalex.org/W1991133427","https://openalex.org/W2003531160","https://openalex.org/W2006813606","https://openalex.org/W2035227369","https://openalex.org/W2045099270","https://openalex.org/W2045407304","https://openalex.org/W2060090091","https://openalex.org/W2098544961","https://openalex.org/W2101265337","https://openalex.org/W2108890528","https://openalex.org/W2121606987","https://openalex.org/W2128765501","https://openalex.org/W2130509920","https://openalex.org/W2130914270","https://openalex.org/W2135479785","https://openalex.org/W2136428131","https://openalex.org/W2137107406","https://openalex.org/W2138308684","https://openalex.org/W2139252928","https://openalex.org/W2141433200","https://openalex.org/W2145558362","https://openalex.org/W2147749157","https://openalex.org/W2152615896","https://openalex.org/W2152797116","https://openalex.org/W2154315166","https://openalex.org/W2161822490","https://openalex.org/W2165205968","https://openalex.org/W2167985364","https://openalex.org/W2168821867","https://openalex.org/W2233344468","https://openalex.org/W2296125569","https://openalex.org/W2296600582","https://openalex.org/W2899702797","https://openalex.org/W2949747623","https://openalex.org/W3004173728","https://openalex.org/W3136666733","https://openalex.org/W4229922087","https://openalex.org/W4252713891","https://openalex.org/W6680507171","https://openalex.org/W6684259858","https://openalex.org/W6697416319"],"related_works":["https://openalex.org/W2169710030","https://openalex.org/W2126543779","https://openalex.org/W2147429396","https://openalex.org/W135568846","https://openalex.org/W2460434904","https://openalex.org/W2167713507","https://openalex.org/W1789159349","https://openalex.org/W2540115800","https://openalex.org/W2209506458","https://openalex.org/W2113911300"],"abstract_inverted_index":{"Spinal":[0],"codes":[1,8,148,191],"are":[2,192],"a":[3,20,41,51,138,142,168,193],"new":[4],"class":[5],"of":[6,40,53,141,165,170],"rateless":[7,156,162],"that":[9,61,65,146,180,189],"enable":[10],"wireless":[11],"networks":[12],"to":[13,45,49,72,87],"cope":[14],"with":[15],"time-varying":[16],"channel":[17,131,171],"conditions":[18,172],"in":[19,33,67,109,112,186],"natural":[21],"way,":[22],"without":[23],"requiring":[24],"any":[25],"explicit":[26],"bit":[27,70,90],"rate":[28],"selection.":[29],"The":[30],"key":[31],"idea":[32],"the":[34,37,46,78,104,113,118,160],"code":[35],"is":[36],"sequential":[38],"application":[39],"pseudo-random":[42],"hash":[43],"function":[44],"message":[47,114,174],"bits":[48],"produce":[50],"sequence":[52],"coded":[54,75],"symbols":[55],"for":[56],"transmission.":[57],"This":[58],"encoding":[59],"ensures":[60],"two":[62],"input":[63],"messages":[64],"differ":[66],"even":[68],"one":[69],"lead":[71],"very":[73],"different":[74],"sequences":[76],"after":[77],"point":[79],"at":[80,183],"which":[81,107],"they":[82],"differ,":[83],"providing":[84],"good":[85],"resilience":[86],"noise":[88,126],"and":[89,116,128,159,173],"errors.":[91],"To":[92],"decode":[93,182],"spinal":[94,147,190],"codes,":[95,155,158],"this":[96],"paper":[97],"develops":[98],"an":[99],"approximate":[100],"maximum-likelihood":[101],"decoder,":[102,106],"called":[103],"bubble":[105],"runs":[108],"time":[110],"polynomial":[111],"size":[115],"achieves":[117],"Shannon":[119],"capacity":[120],"over":[121],"both":[122],"additive":[123],"white":[124],"Gaussian":[125],"(AWGN)":[127],"binary":[129],"symmetric":[130],"(BSC)":[132],"models.":[133],"Experimental":[134],"results":[135],"obtained":[136],"from":[137],"software":[139],"implementation":[140],"linear-time":[143],"decoder":[144],"show":[145],"achieve":[149],"higher":[150],"throughput":[151],"than":[152],"fixed-rate":[153],"LDPC":[154],"Raptor":[157],"layered":[161],"coding":[163],"approach":[164],"Strider,":[166],"across":[167],"range":[169],"sizes.":[175],"An":[176],"early":[177],"hardware":[178],"prototype":[179],"can":[181],"10":[184],"Mbits/s":[185],"FPGA":[187],"demonstrates":[188],"practical":[194],"construction.":[195]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":18},{"year":2018,"cited_by_count":19},{"year":2017,"cited_by_count":13},{"year":2016,"cited_by_count":18},{"year":2015,"cited_by_count":19},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":3}],"updated_date":"2026-03-09T08:58:05.943551","created_date":"2016-06-24T00:00:00"}