{"id":"https://openalex.org/W2801400867","doi":"https://doi.org/10.1109/tit.2019.2912165","title":"Reliable and Secure Multishot Network Coding Using Linearized Reed-Solomon Codes","display_name":"Reliable and Secure Multishot Network Coding Using Linearized Reed-Solomon Codes","publication_year":2019,"publication_date":"2019-04-25","ids":{"openalex":"https://openalex.org/W2801400867","doi":"https://doi.org/10.1109/tit.2019.2912165","mag":"2801400867"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2019.2912165","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2019.2912165","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1805.03789","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Umberto Martinez-Penas","orcid":"https://orcid.org/0000-0003-2626-8139"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Umberto Martinez-Penas","raw_affiliation_strings":["The Edward S. Rogers Sr. Department of Electrical and Computer Engineering, University of Toronto, Toronto, ON, Canada"],"raw_orcid":"https://orcid.org/0000-0003-2626-8139","affiliations":[{"raw_affiliation_string":"The Edward S. Rogers Sr. Department of Electrical and Computer Engineering, University of Toronto, Toronto, ON, Canada","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":null,"display_name":"Frank R. Kschischang","orcid":"https://orcid.org/0000-0002-4274-1785"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Frank R. Kschischang","raw_affiliation_strings":["The Edward S. Rogers Sr. Department of Electrical and Computer Engineering, University of Toronto, Toronto, ON, Canada"],"raw_orcid":"https://orcid.org/0000-0002-4274-1785","affiliations":[{"raw_affiliation_string":"The Edward S. Rogers Sr. Department of Electrical and Computer Engineering, University of Toronto, Toronto, ON, Canada","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.5084,"has_fulltext":true,"cited_by_count":62,"citation_normalized_percentile":{"value":0.96910935,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"65","issue":"8","first_page":"4785","last_page":"4803"},"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.9753000140190125,"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.9753000140190125,"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/T11130","display_name":"Coding theory and cryptography","score":0.010499999858438969,"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/T11797","display_name":"graph theory and CDMA systems","score":0.00139999995008111,"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/linear-network-coding","display_name":"Linear network coding","score":0.7746000289916992},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.7609000205993652},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.6449999809265137},{"id":"https://openalex.org/keywords/channel-code","display_name":"Channel code","score":0.5789999961853027},{"id":"https://openalex.org/keywords/information-theoretic-security","display_name":"Information-theoretic security","score":0.5314000248908997},{"id":"https://openalex.org/keywords/secrecy","display_name":"Secrecy","score":0.5249000191688538},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4871000051498413},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4235000014305115},{"id":"https://openalex.org/keywords/shannon\u2013fano-coding","display_name":"Shannon\u2013Fano coding","score":0.4099000096321106},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4083999991416931}],"concepts":[{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.7746000289916992},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.7609000205993652},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.6449999809265137},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6033999919891357},{"id":"https://openalex.org/C166366890","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Channel code","level":3,"score":0.5789999961853027},{"id":"https://openalex.org/C47191418","wikidata":"https://www.wikidata.org/wiki/Q3510462","display_name":"Information-theoretic security","level":3,"score":0.5314000248908997},{"id":"https://openalex.org/C2776452267","wikidata":"https://www.wikidata.org/wiki/Q1503443","display_name":"Secrecy","level":2,"score":0.5249000191688538},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5220999717712402},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5062000155448914},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4871000051498413},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4235000014305115},{"id":"https://openalex.org/C130811719","wikidata":"https://www.wikidata.org/wiki/Q2645","display_name":"Shannon\u2013Fano coding","level":4,"score":0.4099000096321106},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4083999991416931},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3930000066757202},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.3874000012874603},{"id":"https://openalex.org/C204397858","wikidata":"https://www.wikidata.org/wiki/Q4437907","display_name":"List decoding","level":5,"score":0.3741999864578247},{"id":"https://openalex.org/C101722063","wikidata":"https://www.wikidata.org/wiki/Q218825","display_name":"Random access","level":2,"score":0.37389999628067017},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.3707999885082245},{"id":"https://openalex.org/C76132124","wikidata":"https://www.wikidata.org/wiki/Q5474786","display_name":"Fountain code","level":5,"score":0.36079999804496765},{"id":"https://openalex.org/C194405637","wikidata":"https://www.wikidata.org/wiki/Q369367","display_name":"Repetition code","level":5,"score":0.3490000069141388},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.3450999855995178},{"id":"https://openalex.org/C113709454","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Coding theory","level":2,"score":0.3393000066280365},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.3384999930858612},{"id":"https://openalex.org/C77926391","wikidata":"https://www.wikidata.org/wiki/Q603880","display_name":"Finite field","level":2,"score":0.32589998841285706},{"id":"https://openalex.org/C206468330","wikidata":"https://www.wikidata.org/wiki/Q834373","display_name":"Code rate","level":3,"score":0.3257000148296356},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.31859999895095825},{"id":"https://openalex.org/C3019527723","wikidata":"https://www.wikidata.org/wiki/Q260899","display_name":"Field size","level":3,"score":0.3138999938964844},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.30559998750686646},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.301800012588501},{"id":"https://openalex.org/C192126672","wikidata":"https://www.wikidata.org/wiki/Q1068715","display_name":"Telecommunications network","level":2,"score":0.29580000042915344},{"id":"https://openalex.org/C41065033","wikidata":"https://www.wikidata.org/wiki/Q2825412","display_name":"Adversary","level":2,"score":0.29010000824928284},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.289900004863739},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.2897000014781952},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.28130000829696655},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2809000015258789},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.27399998903274536},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2662999927997589},{"id":"https://openalex.org/C173988684","wikidata":"https://www.wikidata.org/wiki/Q863510","display_name":"Binary symmetric channel","level":4,"score":0.26159998774528503},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.25920000672340393},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.2558000087738037}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tit.2019.2912165","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2019.2912165","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1805.03789","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1805.03789","pdf_url":"https://arxiv.org/pdf/1805.03789","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"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1805.03789","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1805.03789","pdf_url":"https://arxiv.org/pdf/1805.03789","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":[{"id":"https://openalex.org/G263450949","display_name":null,"funder_award_id":"DFF-7027-00053B","funder_id":"https://openalex.org/F4320310485","funder_display_name":"Natur og Univers, Det Frie Forskningsr\u00e5d"}],"funders":[{"id":"https://openalex.org/F4320310485","display_name":"Natur og Univers, Det Frie Forskningsr\u00e5d","ror":"https://ror.org/03ge1nb22"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2801400867.pdf","grobid_xml":"https://content.openalex.org/works/W2801400867.grobid-xml"},"referenced_works_count":53,"referenced_works":["https://openalex.org/W15145434","https://openalex.org/W1492657530","https://openalex.org/W1515351491","https://openalex.org/W1672384623","https://openalex.org/W1785358459","https://openalex.org/W1965969834","https://openalex.org/W1966237841","https://openalex.org/W1991869485","https://openalex.org/W1993359877","https://openalex.org/W2006947308","https://openalex.org/W2006989139","https://openalex.org/W2014554046","https://openalex.org/W2020484625","https://openalex.org/W2022069541","https://openalex.org/W2026288260","https://openalex.org/W2038530023","https://openalex.org/W2048235391","https://openalex.org/W2050687505","https://openalex.org/W2055060019","https://openalex.org/W2083270107","https://openalex.org/W2089248193","https://openalex.org/W2095980332","https://openalex.org/W2098125062","https://openalex.org/W2105188036","https://openalex.org/W2105831729","https://openalex.org/W2106403318","https://openalex.org/W2106570206","https://openalex.org/W2118456153","https://openalex.org/W2126824576","https://openalex.org/W2128555802","https://openalex.org/W2130358229","https://openalex.org/W2136237463","https://openalex.org/W2138928022","https://openalex.org/W2139416652","https://openalex.org/W2141420453","https://openalex.org/W2148575324","https://openalex.org/W2152303628","https://openalex.org/W2157328738","https://openalex.org/W2200129849","https://openalex.org/W2323514020","https://openalex.org/W2331005958","https://openalex.org/W2340260419","https://openalex.org/W2585368599","https://openalex.org/W2597417053","https://openalex.org/W2744911370","https://openalex.org/W2774323520","https://openalex.org/W2787560290","https://openalex.org/W2963073980","https://openalex.org/W2963297998","https://openalex.org/W6600739974","https://openalex.org/W6680315945","https://openalex.org/W6697983304","https://openalex.org/W6728374566"],"related_works":[],"abstract_inverted_index":{"Multishot":[0],"network":[1,54,59],"coding":[2,73,131],"is":[3,81,108,151,173,205,245],"considered":[4],"in":[5,10,23,210,261,296,301,313],"a":[6,44,72,179,275,279,299,302],"worst-case":[7],"adversarial":[8],"setting":[9],"which":[11,172,186,218],"an":[12],"omniscient":[13],"adversary":[14],"with":[15,70,138,236],"unbounded":[16],"computational":[17],"resources":[18],"may":[19,65],"inject":[20],"erroneous":[21],"packets":[22,102],"up":[24,29,35],"to":[25,30,36,142,222],"t":[26],"links,":[27,38],"erase":[28],"p":[31],"packets,":[32],"and":[33,61,68,78,217,232],"wire-tap":[34],"\u03bc":[37],"all":[39],"throughout":[40],"I":[41,184],"shots":[42],"of":[43,50,97,111,178,246,281],"linearly-coded":[45],"network.":[46],"Assuming":[47],"no":[48],"knowledge":[49],"the":[51,58,91,109,115,211,237,241,268],"underlying":[52,62],"linear":[53,63],"code":[55,64,181,277],"(in":[56],"particular,":[57],"topology":[60],"be":[66,188,220],"random":[67],"change":[69],"time),":[71],"scheme":[74,89],"achieving":[75],"zero-error":[76],"communication":[77,135],"perfect":[79],"secrecy":[80],"obtained":[82,137,238],"based":[83],"on":[84],"linearized":[85,202],"Reed-Solomon":[86,203],"codes.":[87],"The":[88,147],"achieves":[90],"maximum":[92],"possible":[93,125],"secret":[94],"message":[95],"size":[96,150],"\u2113n'":[98],"-2t":[99],"-p":[100],"-\u03bc":[101],"for":[103,117,133,144,183,201,274],"coherent":[104],"communication,":[105],"where":[106,157],"n'":[107,123],"number":[110],"outgoing":[112],"links":[113],"at":[114,189],"source,":[116],"any":[118],"packet":[119],"length":[120,213],"m":[121],"\u2265":[122],"(largest":[124],"range).":[126],"By":[127],"lifting":[128],"this":[129],"construction,":[130],"schemes":[132],"non-coherent":[134,233],"are":[136],"information":[139],"rates":[140],"close":[141],"optimal":[143],"practical":[145],"instances.":[146],"required":[148],"field":[149,239,304],"q":[152,158,162],"<sup":[153,163,168,192,248,252,256,283,287,291,309],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[154,164,169,193,249,253,257,264,284,288,292,310,316],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">m</sup>":[155,165],",":[156,171,266],">":[159],"\u2113,":[160],"thus":[161],"\u2248":[166],"\u2113":[167,251,286],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">n'</sup>":[170],"always":[174],"smaller":[175],"than":[176],"that":[177],"Gabidulin":[180,276],"tailored":[182],"shots,":[185],"would":[187],"least":[190],"2":[191],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">\u2113n'</sup>":[194],".":[195,318],"A":[196],"Welch-Berlekamp":[197],"sum-rank":[198],"decoding":[199,243,272],"algorithm":[200,273],"codes":[204],"provided,":[206],"having":[207],"quadratic":[208],"complexity":[209,244,280],"total":[212],"n":[214],"=":[215],"\u2113n',":[216],"can":[219],"adapted":[221],"handle":[223],"not":[224],"only":[225],"errors":[226],"but":[227],"also":[228],"erasures,":[229],"wiretap":[230],"observations":[231],"communication.":[234],"Combined":[235],"size,":[240],"given":[242],"O(n":[247,282],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">'4</sup>":[250],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[254,258,293,311],"log(\u2113)":[255,290],")":[259,294],"operations":[260,295,312],"F":[262,305,314],"<sub":[263,315],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sub>":[265,317],"whereas":[267],"most":[269],"efficient":[270],"known":[271],"has":[278],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">'3.69</sup>":[285],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">3.69</sup>":[289],"F2,":[297],"assuming":[298],"multiplication":[300],"finite":[303],"costs":[306],"about":[307],"log(|F|)":[308]},"counts_by_year":[{"year":2025,"cited_by_count":6},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":13},{"year":2022,"cited_by_count":16},{"year":2021,"cited_by_count":10},{"year":2020,"cited_by_count":9}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2018-05-17T00:00:00"}