{"id":"https://openalex.org/W4289713193","doi":"https://doi.org/10.1109/isit50566.2022.9834842","title":"On Information-Debt-Optimal Streaming Codes With Small Memory","display_name":"On Information-Debt-Optimal Streaming Codes With Small Memory","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4289713193","doi":"https://doi.org/10.1109/isit50566.2022.9834842"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834842","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834842","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","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 International Symposium on Information Theory (ISIT)","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/A5091221122","display_name":"Vinayak Ramkumar","orcid":"https://orcid.org/0000-0001-5223-5643"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Vinayak Ramkumar","raw_affiliation_strings":["IISc,Department of Electrical Communication Engineering,Bangalore","Department of Electrical Communication Engineering, IISc, Bangalore"],"affiliations":[{"raw_affiliation_string":"IISc,Department of Electrical Communication Engineering,Bangalore","institution_ids":[]},{"raw_affiliation_string":"Department of Electrical Communication Engineering, IISc, Bangalore","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056042146","display_name":"M. Nikhil Krishnan","orcid":"https://orcid.org/0000-0003-0089-676X"},"institutions":[{"id":"https://openalex.org/I181514455","display_name":"International Institute of Information Technology Bangalore","ror":"https://ror.org/05h9eqy10","country_code":"IN","type":"education","lineage":["https://openalex.org/I181514455"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"M. Nikhil Krishnan","raw_affiliation_strings":["International Institute of Information Technology,Bangalore","International Institute of Information Technology, Bangalore"],"affiliations":[{"raw_affiliation_string":"International Institute of Information Technology,Bangalore","institution_ids":["https://openalex.org/I181514455"]},{"raw_affiliation_string":"International Institute of Information Technology, Bangalore","institution_ids":["https://openalex.org/I181514455"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5048702271","display_name":"Myna Vajha","orcid":"https://orcid.org/0000-0002-7770-2583"},"institutions":[{"id":"https://openalex.org/I19268510","display_name":"Qualcomm (United Kingdom)","ror":"https://ror.org/04d3djg48","country_code":"GB","type":"company","lineage":["https://openalex.org/I19268510","https://openalex.org/I4210087596"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Myna Vajha","raw_affiliation_strings":["Qualcomm,Bengaluru","Qualcomm, Bengaluru"],"affiliations":[{"raw_affiliation_string":"Qualcomm,Bengaluru","institution_ids":["https://openalex.org/I19268510"]},{"raw_affiliation_string":"Qualcomm, Bengaluru","institution_ids":["https://openalex.org/I19268510"]}]},{"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,Department of Electrical Communication Engineering,Bangalore","Department of Electrical Communication Engineering, IISc, Bangalore"],"affiliations":[{"raw_affiliation_string":"IISc,Department of Electrical Communication Engineering,Bangalore","institution_ids":[]},{"raw_affiliation_string":"Department of Electrical Communication Engineering, IISc, Bangalore","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5091221122"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2962,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.77742426,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1578","last_page":"1583"},"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.9980000257492065,"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.9980000257492065,"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.9973999857902527,"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/T11478","display_name":"Caching and Content Delivery","score":0.9944999814033508,"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/convolutional-code","display_name":"Convolutional code","score":0.7178553938865662},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5377547740936279},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.5179566144943237},{"id":"https://openalex.org/keywords/erasure-code","display_name":"Erasure code","score":0.5003049373626709},{"id":"https://openalex.org/keywords/turbo-code","display_name":"Turbo code","score":0.4912251830101013},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.4906708002090454},{"id":"https://openalex.org/keywords/symbol","display_name":"Symbol (formal)","score":0.4806850850582123},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.47755083441734314},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.45770999789237976},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.4541283845901489},{"id":"https://openalex.org/keywords/online-codes","display_name":"Online codes","score":0.43641045689582825},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42508310079574585},{"id":"https://openalex.org/keywords/serial-concatenated-convolutional-codes","display_name":"Serial concatenated convolutional codes","score":0.41598597168922424},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35831230878829956},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3493289649486542},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34540775418281555}],"concepts":[{"id":"https://openalex.org/C157899210","wikidata":"https://www.wikidata.org/wiki/Q1395022","display_name":"Convolutional code","level":3,"score":0.7178553938865662},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5377547740936279},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.5179566144943237},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.5003049373626709},{"id":"https://openalex.org/C114504821","wikidata":"https://www.wikidata.org/wiki/Q2164281","display_name":"Turbo code","level":3,"score":0.4912251830101013},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.4906708002090454},{"id":"https://openalex.org/C134400042","wikidata":"https://www.wikidata.org/wiki/Q2372244","display_name":"Symbol (formal)","level":2,"score":0.4806850850582123},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.47755083441734314},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.45770999789237976},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.4541283845901489},{"id":"https://openalex.org/C103093684","wikidata":"https://www.wikidata.org/wiki/Q7094069","display_name":"Online codes","level":5,"score":0.43641045689582825},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42508310079574585},{"id":"https://openalex.org/C33529081","wikidata":"https://www.wikidata.org/wiki/Q18378194","display_name":"Serial concatenated convolutional codes","level":5,"score":0.41598597168922424},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35831230878829956},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3493289649486542},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34540775418281555},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"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":1,"locations":[{"id":"doi:10.1109/isit50566.2022.9834842","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834842","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","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 International Symposium on Information Theory (ISIT)","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":23,"referenced_works":["https://openalex.org/W1590749237","https://openalex.org/W2078724035","https://openalex.org/W2113967464","https://openalex.org/W2125921054","https://openalex.org/W2143241245","https://openalex.org/W2171283709","https://openalex.org/W2340260419","https://openalex.org/W2911280162","https://openalex.org/W2913533115","https://openalex.org/W2963225233","https://openalex.org/W2963900659","https://openalex.org/W2990112497","https://openalex.org/W3013193461","https://openalex.org/W3081253662","https://openalex.org/W3100552666","https://openalex.org/W3196454771","https://openalex.org/W3198286429","https://openalex.org/W3206731135","https://openalex.org/W4200635817","https://openalex.org/W4287549987","https://openalex.org/W6770384336","https://openalex.org/W6787569868","https://openalex.org/W7065094221"],"related_works":["https://openalex.org/W2209506458","https://openalex.org/W2015741799","https://openalex.org/W2133192723","https://openalex.org/W2139406003","https://openalex.org/W2015101254","https://openalex.org/W1580452828","https://openalex.org/W2097755885","https://openalex.org/W2047940635","https://openalex.org/W2097335705","https://openalex.org/W2161191727"],"abstract_inverted_index":{"In":[0,109],"the":[1,11,17,24,29,40,57,71,77,88,101,110,120,124,149,187,201],"context":[2],"of":[3,13,19,31,42,59,87,151,183,195],"an":[4],"(n,k,m)":[5,60,115],"convolutional":[6,61,116,171],"code":[7,20],"where":[8],"k":[9],"is":[10,39,74,92,131,203],"number":[12,18,41],"message":[14,51,68,107],"symbols,":[15],"n":[16],"symbols":[21,45,69],"and":[22,167],"m":[23,128],"memory,":[25],"Martinian":[26],"[1]":[27],"introduced":[28],"concept":[30],"information":[32,89],"debt":[33,90],"whose":[34],"value":[35],"at":[36,93],"time":[37,79],"t":[38],"additional":[43],"coded":[44],"needed":[46,190],"to":[47,85,133,139],"decode":[48],"all":[49,66,157],"prior":[50,67],"symbols.":[52],"The":[53,96],"same":[54],"paper":[55],"shows":[56],"existence":[58,150,185],"codes":[62,117,141,155,166,172,175,197],"that":[63,76,118,164],"can":[64],"recover":[65],"whenever":[70,129],"symbol-erasure":[72],"pattern":[73],"such":[75,140],"maximum":[78],"interval":[80],"\u03c4":[81,98,126],"between":[82],"successive":[83],"returns":[84],"zero":[86],"function":[91],"most":[94],"m.":[95],"parameter":[97,178],"also":[99,162],"represents":[100],"worst-case":[102],"delay":[103],"in":[104,200],"decoding":[105],"a":[106,181,192],"symbol.":[108],"present":[111],"paper,":[112],"we":[113],"study":[114],"possess":[119],"analogous":[121],"property":[122],"for":[123,156,176,191],"case":[125],">":[127],"it":[130],"possible":[132,158],"do":[134],"so.":[135],"We":[136,147,161],"will":[137],"refer":[138],"as":[142],"information-debt-optimal":[143],"streaming":[144,196],"(iDOS)":[145],"codes.":[146],"prove":[148],"periodically":[152],"time-varying":[153],"iDOS":[154,174],"{n,k,m,\u03c4}":[159],"parameters.":[160],"show":[163],"m-MDS":[165],"Maximum":[168],"Distance":[169],"Profile":[170],"are":[173],"certain":[177],"ranges.":[179],"As":[180],"by-product":[182],"our":[184],"result,":[186],"minimum":[188],"memory":[189],"particular":[193],"class":[194],"studied":[198],"earlier":[199],"literature,":[202],"determined.":[204]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3}],"updated_date":"2026-03-14T06:41:57.775601","created_date":"2025-10-10T00:00:00"}