{"id":"https://openalex.org/W4310901935","doi":"https://doi.org/10.1109/itw54588.2022.9965940","title":"Rate-Optimal Streaming Codes with Smaller Field Size Under Less-Stringent Decoding-Delay Requirements","display_name":"Rate-Optimal Streaming Codes with Smaller Field Size Under Less-Stringent Decoding-Delay Requirements","publication_year":2022,"publication_date":"2022-11-01","ids":{"openalex":"https://openalex.org/W4310901935","doi":"https://doi.org/10.1109/itw54588.2022.9965940"},"language":"en","primary_location":{"id":"doi:10.1109/itw54588.2022.9965940","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw54588.2022.9965940","pdf_url":null,"source":{"id":"https://openalex.org/S4363606450","display_name":"2022 IEEE Information Theory Workshop (ITW)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE Information Theory Workshop (ITW)","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/A5032725280","display_name":"Shobhit Bhatnagar","orcid":"https://orcid.org/0009-0004-8255-7183"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Shobhit Bhatnagar","raw_affiliation_strings":["IISc Bangalore,Department of Electrical Communication Engineering","Department of Electrical Communication Engineering, IISc Bangalore"],"affiliations":[{"raw_affiliation_string":"IISc Bangalore,Department of Electrical Communication Engineering","institution_ids":[]},{"raw_affiliation_string":"Department of Electrical Communication Engineering, IISc Bangalore","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091221122","display_name":"Vinayak Ramkumar","orcid":"https://orcid.org/0000-0001-5223-5643"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vinayak Ramkumar","raw_affiliation_strings":["IISc Bangalore,Department of Electrical Communication Engineering","Department of Electrical Communication Engineering, IISc Bangalore"],"affiliations":[{"raw_affiliation_string":"IISc Bangalore,Department of Electrical Communication Engineering","institution_ids":[]},{"raw_affiliation_string":"Department of Electrical Communication Engineering, IISc Bangalore","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000294837","display_name":"P. Vijay Kumar","orcid":"https://orcid.org/0000-0003-0990-2847"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"P. Vijay Kumar","raw_affiliation_strings":["IISc Bangalore,Department of Electrical Communication Engineering","Department of Electrical Communication Engineering, IISc Bangalore"],"affiliations":[{"raw_affiliation_string":"IISc Bangalore,Department of Electrical Communication Engineering","institution_ids":[]},{"raw_affiliation_string":"Department of Electrical Communication Engineering, IISc Bangalore","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5032725280"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0799,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.74568966,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"612","last_page":"617"},"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.9965999722480774,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9961000084877014,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.7065039277076721},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.6917304396629333},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.6750093698501587},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6415350437164307},{"id":"https://openalex.org/keywords/erasure-code","display_name":"Erasure code","score":0.5816080570220947},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.5583149790763855},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.547457218170166},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5451397895812988},{"id":"https://openalex.org/keywords/sliding-window-protocol","display_name":"Sliding window protocol","score":0.5243135690689087},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4777887761592865},{"id":"https://openalex.org/keywords/online-codes","display_name":"Online codes","score":0.47101128101348877},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4507633447647095},{"id":"https://openalex.org/keywords/code-rate","display_name":"Code rate","score":0.4150789976119995},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.30428996682167053},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.27203893661499023},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2649169862270355},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.23953983187675476},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.2259610891342163},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.22122052311897278},{"id":"https://openalex.org/keywords/window","display_name":"Window (computing)","score":0.12853646278381348}],"concepts":[{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.7065039277076721},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.6917304396629333},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.6750093698501587},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6415350437164307},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.5816080570220947},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.5583149790763855},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.547457218170166},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5451397895812988},{"id":"https://openalex.org/C102392041","wikidata":"https://www.wikidata.org/wiki/Q592860","display_name":"Sliding window protocol","level":3,"score":0.5243135690689087},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4777887761592865},{"id":"https://openalex.org/C103093684","wikidata":"https://www.wikidata.org/wiki/Q7094069","display_name":"Online codes","level":5,"score":0.47101128101348877},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4507633447647095},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.4150789976119995},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.30428996682167053},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.27203893661499023},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2649169862270355},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.23953983187675476},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.2259610891342163},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.22122052311897278},{"id":"https://openalex.org/C2778751112","wikidata":"https://www.wikidata.org/wiki/Q835016","display_name":"Window (computing)","level":2,"score":0.12853646278381348},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/itw54588.2022.9965940","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itw54588.2022.9965940","pdf_url":null,"source":{"id":"https://openalex.org/S4363606450","display_name":"2022 IEEE Information Theory Workshop (ITW)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE Information Theory Workshop (ITW)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W32864775","https://openalex.org/W1594652978","https://openalex.org/W1606480398","https://openalex.org/W1968974808","https://openalex.org/W2013271657","https://openalex.org/W2031335939","https://openalex.org/W2041115627","https://openalex.org/W2066422082","https://openalex.org/W2078724035","https://openalex.org/W2100137244","https://openalex.org/W2108579675","https://openalex.org/W2113967464","https://openalex.org/W2125921054","https://openalex.org/W2143241245","https://openalex.org/W2586580216","https://openalex.org/W2913533115","https://openalex.org/W2962717093","https://openalex.org/W2963225233","https://openalex.org/W2964182635","https://openalex.org/W2976706786","https://openalex.org/W2990112497","https://openalex.org/W3013193461","https://openalex.org/W3081071837","https://openalex.org/W3081072124","https://openalex.org/W3081253662","https://openalex.org/W3100552666","https://openalex.org/W3196454771","https://openalex.org/W3197406425","https://openalex.org/W3198286429","https://openalex.org/W3206731135","https://openalex.org/W3214381038","https://openalex.org/W3215602683","https://openalex.org/W3215828111","https://openalex.org/W3216143737","https://openalex.org/W3216579520","https://openalex.org/W4239889878","https://openalex.org/W4289812968","https://openalex.org/W6601334462","https://openalex.org/W6770384336"],"related_works":["https://openalex.org/W2982181605","https://openalex.org/W2744779861","https://openalex.org/W2113562070","https://openalex.org/W2149057203","https://openalex.org/W1989156844","https://openalex.org/W2004376844","https://openalex.org/W1971149437","https://openalex.org/W2031335939","https://openalex.org/W2137028263","https://openalex.org/W2951344115"],"abstract_inverted_index":{"Streaming":[0],"codes":[1,5,42,159,239],"are":[2,43,259,268],"packet-level":[3],"erasure-recovery":[4],"which":[6],"offer":[7],"reliability":[8],"in":[9,149,200,218,228],"the":[10,60,74,150,155,192,195,207,229,242],"presence":[11],"of":[12,40,81,90,101,117,142,157],"burst":[13,89],"or":[14,96],"random":[15,99],"packet":[16,83,135,143],"erasures,":[17],"while":[18],"operating":[19,107],"under":[20,128],"a":[21,30,46,56,88,98,102,129,170,203,279],"strict":[22],"decoding-delay":[23,130],"constraint.":[24],"The":[25,147,264],"Gilbert-Elliott":[26],"channel":[27,32,49,113,171,183],"model":[28,33,50],"is":[29,86,94,198,234],"commonly-accepted":[31],"for":[34,45,168,178,191,206,241],"such":[35,169],"settings.":[36],"Most":[37],"recent":[38],"designs":[39],"streaming":[41,105,158],"designed":[44,205],"sliding-window":[47],"(SW)":[48],"that":[51,76,93,134,160,232,253],"may":[52],"be":[53,115,138,216],"viewed":[54],"as":[55],"tractable":[57],"approximation":[58],"to":[59,236,262,278],"GE":[61],"channel.":[62],"An":[63],"(a,":[64,110,180],"b,":[65,111,181],"w)-SW":[66,112,182],"channel,":[67],"admits":[68],"only":[69],"those":[70],"erasure":[71,122],"patterns":[72],"having":[73],"property":[75],"within":[77],"any":[78,120,179],"sliding":[79],"window":[80],"w":[82],"durations,":[84],"there":[85,173],"either":[87],"b":[91,250],"packets":[92],"erased,":[95],"else":[97],"set":[100],"packets.":[103],"A":[104],"code":[106,166,176,204],"over":[108],"an":[109,162],"should":[114],"capable":[116],"recovering":[118],"from":[119],"admissible":[121],"pattern":[123],"and":[124,172,190,258,272,281],"must":[125,137],"do":[126],"so":[127],"constraint":[131],"\u03c4,":[132],"meaning":[133],"t":[136],"decoded":[139],"upon":[140],"arrival":[141],"(t":[144],"+":[145,249],"\u03c4).":[146],"focus":[148],"literature":[151],"has":[152],"been":[153],"on":[154,165,270],"construction":[156],"achieve":[161],"upper":[163],"bound":[164],"rate":[167],"exist":[174],"rate-optimal":[175,238],"constructions":[177,265],"with":[184],"\u03c4":[185,209,221,244],"=":[186,210],"(w":[187,211,223,246],"\u2212":[188,212,224,247,251],"1),":[189,225],"general":[193],"case,":[194],"field-size":[196,256,283],"requirement":[197,257],"quadratic":[199],"w.":[201],"While":[202],"case":[208],"1)":[213],"can":[214],"also":[215],"employed":[217],"settings":[219],"where":[220],">":[222],"we":[226],"show":[227],"present":[230],"paper":[231],"it":[233],"possible":[235],"construct":[237],"specifically":[240],"regime":[243],"\u2265":[245],"1":[248],"a)":[252],"have":[254],"smaller":[255],"hence":[260],"simpler":[261],"implement.":[263],"presented":[266],"here":[267],"based":[269],"MDS":[271],"binary":[273,282],"cyclic":[274],"codes,":[275],"corresponding":[276],"respectively":[277],"linear":[280],"requirement.":[284]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3}],"updated_date":"2025-11-28T02:08:47.144824","created_date":"2025-10-10T00:00:00"}