{"id":"https://openalex.org/W3125973410","doi":"https://doi.org/10.1109/isit45174.2021.9518168","title":"Real-time oblivious erasure correction with linear time decoding and constant feedback","display_name":"Real-time oblivious erasure correction with linear time decoding and constant feedback","publication_year":2021,"publication_date":"2021-07-12","ids":{"openalex":"https://openalex.org/W3125973410","doi":"https://doi.org/10.1109/isit45174.2021.9518168","mag":"3125973410"},"language":"en","primary_location":{"id":"doi:10.1109/isit45174.2021.9518168","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit45174.2021.9518168","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2101.11136","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078443823","display_name":"Shashwat Silas","orcid":"https://orcid.org/0000-0002-1742-7137"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Shashwat Silas","raw_affiliation_strings":["Stanford University,CA,USA,94305","Stanford University ()"],"affiliations":[{"raw_affiliation_string":"Stanford University,CA,USA,94305","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Stanford University ()","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5078443823"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.02132271,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1361","last_page":"1366"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","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/T11321","display_name":"Error Correcting Code Techniques","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/T11269","display_name":"Algorithms and Data Compression","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12029","display_name":"DNA and Biological Computing","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.8543795347213745},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7847661972045898},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7340326309204102},{"id":"https://openalex.org/keywords/online-codes","display_name":"Online codes","score":0.6558893918991089},{"id":"https://openalex.org/keywords/erasure-code","display_name":"Erasure code","score":0.6161985397338867},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5829144716262817},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.5692685842514038},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.511050820350647},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.50126051902771},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.43589353561401367},{"id":"https://openalex.org/keywords/construct","display_name":"Construct (python library)","score":0.4287462532520294},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4128660261631012},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.3074191212654114},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.1863439381122589},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1465016007423401},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.11437109112739563},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07349726557731628}],"concepts":[{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.8543795347213745},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7847661972045898},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7340326309204102},{"id":"https://openalex.org/C103093684","wikidata":"https://www.wikidata.org/wiki/Q7094069","display_name":"Online codes","level":5,"score":0.6558893918991089},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.6161985397338867},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5829144716262817},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.5692685842514038},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.511050820350647},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.50126051902771},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.43589353561401367},{"id":"https://openalex.org/C2780801425","wikidata":"https://www.wikidata.org/wiki/Q5164392","display_name":"Construct (python library)","level":2,"score":0.4287462532520294},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4128660261631012},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.3074191212654114},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.1863439381122589},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1465016007423401},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.11437109112739563},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07349726557731628},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/isit45174.2021.9518168","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit45174.2021.9518168","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2021 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2101.11136","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2101.11136","pdf_url":"https://arxiv.org/pdf/2101.11136","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"mag:3125973410","is_oa":true,"landing_page_url":"http://export.arxiv.org/pdf/2101.11136","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.2101.11136","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2101.11136","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2101.11136","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2101.11136","pdf_url":"https://arxiv.org/pdf/2101.11136","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3125973410.pdf","grobid_xml":"https://content.openalex.org/works/W3125973410.grobid-xml"},"referenced_works_count":10,"referenced_works":["https://openalex.org/W2025457751","https://openalex.org/W2029712200","https://openalex.org/W2030862412","https://openalex.org/W2109202834","https://openalex.org/W2115104320","https://openalex.org/W2296125569","https://openalex.org/W2296600582","https://openalex.org/W2553707441","https://openalex.org/W3101726976","https://openalex.org/W4229922087"],"related_works":["https://openalex.org/W3197865388","https://openalex.org/W2031335939","https://openalex.org/W747659754","https://openalex.org/W2066422082","https://openalex.org/W2024581747","https://openalex.org/W2563620581","https://openalex.org/W2184885215","https://openalex.org/W2110496854","https://openalex.org/W2908671790","https://openalex.org/W2964199927","https://openalex.org/W337733400","https://openalex.org/W2041115627","https://openalex.org/W2791801255","https://openalex.org/W1966487673","https://openalex.org/W2137660968","https://openalex.org/W2158541565","https://openalex.org/W2058115419","https://openalex.org/W3198886387","https://openalex.org/W2953008149","https://openalex.org/W2510335549"],"abstract_inverted_index":{"We":[0,112],"continue":[1],"the":[2,33,38,42,46,76,100,146,150,163,188,201,210,214,219,223,228],"study":[3],"of":[4,9,15,26,56,138,149,200,206],"rateless":[5,60],"codes":[6,114],"for":[7,135,222],"transmission":[8],"information":[10],"across":[11,37],"channels":[12],"whose":[13],"rate":[14],"erasure":[16,39,61,90,183,204],"is":[17,63,107],"unknown.":[18],"In":[19],"such":[20],"a":[21,53,93,103,136,197],"code,":[22],"an":[23,180],"infinite":[24],"stream":[25],"encoding":[27,57,70,105],"symbols":[28,71],"can":[29,44],"be":[30],"generated":[31],"from":[32,153,167],"message":[34,47,137,192,212],"and":[35,41,124,162,194],"sent":[36],"channel,":[40],"decoder":[43],"decode":[45],"after":[48],"it":[49,85],"has":[50],"successfully":[51],"collected":[52],"certain":[54],"number":[55],"symbols.":[58],"A":[59],"code":[62,184,225],"real-time":[64,88,117,202],"oblivious":[65,89,203],"if":[66],"rather":[67,109],"than":[68,110],"collecting":[69],"as":[72],"they":[73],"are":[74,116],"received,":[75],"receiver":[77],"either":[78],"immediately":[79],"decodes":[80],"or":[81],"discards":[82],"each":[83],"symbol":[84,106],"receives.":[86],"Efficient":[87],"correction":[91,205],"uses":[92,218],"feedback":[94,122,151],"channel":[95,152],"in":[96,132],"order":[97],"to":[98,129,157,171,185,208,213,226],"maximize":[99],"probability":[101],"that":[102],"received":[104],"decoded":[108],"discarded.":[111],"construct":[113],"which":[115,216],"oblivious,":[118],"but":[119],"require":[120],"fewer":[121],"messages":[123],"have":[125],"faster":[126],"decoding":[127,165,220],"compared":[128],"previous":[130],"work":[131],"[1].":[133],"Specifically,":[134],"length":[139],"<tex":[140,154,158,168,172,189],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[141,155,159,169,173,190],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$k^{\\prime}$</tex>":[142,191],",":[143,161],"we":[144],"improve":[145],"expected":[147,164],"complexity":[148,166],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$O(\\sqrt{k^{\\prime}})$</tex>":[156],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$O(1)$</tex>":[160],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$O(k^{\\prime}\\log(k^{\\prime}))$</tex>":[170],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$O(k^{\\prime})$</tex>":[174],".":[175],"Our":[176],"method":[177],"involves":[178],"using":[179,196],"appropriate":[181],"block":[182],"first":[186],"encode":[187],"symbols,":[193],"then":[195,217],"truncated":[198],"version":[199],"[1]":[207],"transmit":[209],"encoded":[211],"receiver,":[215],"algorithm":[221],"outer":[224],"recover":[227],"message.":[229]},"counts_by_year":[],"updated_date":"2026-03-14T06:41:57.775601","created_date":"2025-10-10T00:00:00"}