{"id":"https://openalex.org/W2162789499","doi":"https://doi.org/10.1109/isit.2009.5205380","title":"On multicasting with streaming burst-erasure codes","display_name":"On multicasting with streaming burst-erasure codes","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2162789499","doi":"https://doi.org/10.1109/isit.2009.5205380","mag":"2162789499"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2009.5205380","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205380","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Information Theory","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/A5046253142","display_name":"Ashish Khisti","orcid":"https://orcid.org/0000-0002-2331-8965"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ashish Khisti","raw_affiliation_strings":["Research and Development Laboratory USA, Deutsche Telekom, Inc., Los Altos, CA, USA"],"affiliations":[{"raw_affiliation_string":"Research and Development Laboratory USA, Deutsche Telekom, Inc., Los Altos, CA, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082866143","display_name":"Jatinder Singh","orcid":"https://orcid.org/0000-0002-5102-6564"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jatinder Pal Singh","raw_affiliation_strings":["Research and Development Laboratory USA, Deutsche Telekom, Inc., Los Altos, CA, USA"],"affiliations":[{"raw_affiliation_string":"Research and Development Laboratory USA, Deutsche Telekom, Inc., Los Altos, CA, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5046253142"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0864,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.81469061,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"2887","last_page":"2891"},"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.9998000264167786,"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.9998000264167786,"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.9993000030517578,"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.9986000061035156,"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/multicast","display_name":"Multicast","score":0.9068472385406494},{"id":"https://openalex.org/keywords/erasure-code","display_name":"Erasure code","score":0.7834843397140503},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7785767912864685},{"id":"https://openalex.org/keywords/erasure","display_name":"Erasure","score":0.7188760638237},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6570413112640381},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.605025589466095},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5949599146842957},{"id":"https://openalex.org/keywords/binary-erasure-channel","display_name":"Binary erasure channel","score":0.5825420618057251},{"id":"https://openalex.org/keywords/online-codes","display_name":"Online codes","score":0.45878320932388306},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.40541404485702515},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.21945038437843323},{"id":"https://openalex.org/keywords/channel-capacity","display_name":"Channel capacity","score":0.2183329463005066},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18314379453659058},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.1561281383037567},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.1214943528175354},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11985117197036743}],"concepts":[{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.9068472385406494},{"id":"https://openalex.org/C137529215","wikidata":"https://www.wikidata.org/wiki/Q5385031","display_name":"Erasure code","level":3,"score":0.7834843397140503},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7785767912864685},{"id":"https://openalex.org/C2778790127","wikidata":"https://www.wikidata.org/wiki/Q484885","display_name":"Erasure","level":2,"score":0.7188760638237},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6570413112640381},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.605025589466095},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5949599146842957},{"id":"https://openalex.org/C149862233","wikidata":"https://www.wikidata.org/wiki/Q864142","display_name":"Binary erasure channel","level":4,"score":0.5825420618057251},{"id":"https://openalex.org/C103093684","wikidata":"https://www.wikidata.org/wiki/Q7094069","display_name":"Online codes","level":5,"score":0.45878320932388306},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.40541404485702515},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.21945038437843323},{"id":"https://openalex.org/C97744766","wikidata":"https://www.wikidata.org/wiki/Q870845","display_name":"Channel capacity","level":3,"score":0.2183329463005066},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18314379453659058},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.1561281383037567},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.1214943528175354},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11985117197036743},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2009.5205380","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205380","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.158.115","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.158.115","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.stanford.edu/~jatinder/academic/publications/year/2009/SinghISIT2009.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.4099999964237213,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1541050834","https://openalex.org/W1590749237","https://openalex.org/W1867331094","https://openalex.org/W2083123304","https://openalex.org/W2113967464","https://openalex.org/W2143241245","https://openalex.org/W2949575255","https://openalex.org/W6632166390","https://openalex.org/W6639050370","https://openalex.org/W7065094221"],"related_works":["https://openalex.org/W2982181605","https://openalex.org/W2810502498","https://openalex.org/W2744779861","https://openalex.org/W2130518071","https://openalex.org/W2113562070","https://openalex.org/W2149057203","https://openalex.org/W1989156844","https://openalex.org/W2031335939","https://openalex.org/W2137028263","https://openalex.org/W2951344115"],"abstract_inverted_index":{"We":[0,51],"study":[1],"a":[2,31,40,48,107],"multicast":[3,60,84,109],"extension":[4],"of":[5,117],"streaming":[6,59],"burst-erasure":[7],"codes":[8],"previously":[9],"proposed":[10],"for":[11],"the":[12,23,58,83,100,114],"single":[13],"user":[14],"setting.":[15],"There":[16],"are":[17,45],"two":[18,53,118],"receivers":[19,44],"each":[20,37],"interested":[21,46],"in":[22,47],"common":[24,49],"stream.":[25,50],"Each":[26],"receiver's":[27],"channel":[28,72],"however":[29],"has":[30],"different":[32,41],"burst":[33],"parameter":[34],"and":[35,96],"likewise":[36],"receiver":[38],"tolerates":[39],"delay;":[42],"both":[43],"develop":[52],"upper":[54,64,88],"bounding":[55],"approaches":[56],"on":[57,92],"capacity.":[61],"The":[62,86],"first":[63],"bound":[65,89],"is":[66,90,97],"developed":[67],"by":[68,112],"introducing":[69],"an":[70],"erasure":[71,76],"that":[73],"introduces":[74],"periodic":[75],"bursts,":[77],"which":[78],"can":[79],"corrected":[80],"due":[81],"to":[82],"property.":[85],"second":[87],"based":[91],"information":[93],"theoretic":[94],"inequalities":[95],"tight":[98],"at":[99],"minimum":[101],"delay":[102],"point.":[103],"Finally":[104],"we":[105],"propose":[106],"simple":[108],"code":[110],"construction":[111],"combining":[113],"parity":[115],"checks":[116],"single-user":[119],"codes.":[120]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}