{"id":"https://openalex.org/W2094167931","doi":"https://doi.org/10.1109/netcod.2012.6261876","title":"Hybrid noncoherent network coding","display_name":"Hybrid noncoherent network coding","publication_year":2012,"publication_date":"2012-06-01","ids":{"openalex":"https://openalex.org/W2094167931","doi":"https://doi.org/10.1109/netcod.2012.6261876","mag":"2094167931"},"language":"en","primary_location":{"id":"doi:10.1109/netcod.2012.6261876","is_oa":false,"landing_page_url":"https://doi.org/10.1109/netcod.2012.6261876","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 International Symposium on Network Coding (NetCod)","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/A5048122752","display_name":"Vitaly Skachek","orcid":"https://orcid.org/0000-0002-0626-2437"},"institutions":[{"id":"https://openalex.org/I5023651","display_name":"McGill University","ror":"https://ror.org/01pxwe438","country_code":"CA","type":"education","lineage":["https://openalex.org/I5023651"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Vitaly Skachek","raw_affiliation_strings":["UIUC, Montreal, QUE, Canada","McGill University, 3480 University Street, Montreal, QC H3A 2A7, Canada"],"affiliations":[{"raw_affiliation_string":"UIUC, Montreal, QUE, Canada","institution_ids":[]},{"raw_affiliation_string":"McGill University, 3480 University Street, Montreal, QC H3A 2A7, Canada","institution_ids":["https://openalex.org/I5023651"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084947882","display_name":"Olgica Milenkovi\u0107","orcid":"https://orcid.org/0000-0002-1871-4912"},"institutions":[{"id":"https://openalex.org/I183874917","display_name":"Urbana University","ror":"https://ror.org/04kp3hw27","country_code":"US","type":"education","lineage":["https://openalex.org/I183874917"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Olgica Milenkovic","raw_affiliation_strings":["UIUC, Urbana, IL, USA","UIUC, 1308 W. Main Street, Urbana, IL 61801, USA"],"affiliations":[{"raw_affiliation_string":"UIUC, Urbana, IL, USA","institution_ids":["https://openalex.org/I183874917"]},{"raw_affiliation_string":"UIUC, 1308 W. Main Street, Urbana, IL 61801, USA","institution_ids":["https://openalex.org/I183874917"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110629459","display_name":"Angelia Nedi\u0107","orcid":null},"institutions":[{"id":"https://openalex.org/I183874917","display_name":"Urbana University","ror":"https://ror.org/04kp3hw27","country_code":"US","type":"education","lineage":["https://openalex.org/I183874917"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Angelia Nedic","raw_affiliation_strings":["UIUC, Urbana, IL, USA","UIUC, 1308 W. Main Street, Urbana, IL 61801, USA"],"affiliations":[{"raw_affiliation_string":"UIUC, Urbana, IL, USA","institution_ids":["https://openalex.org/I183874917"]},{"raw_affiliation_string":"UIUC, 1308 W. Main Street, Urbana, IL 61801, USA","institution_ids":["https://openalex.org/I183874917"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5048122752"],"corresponding_institution_ids":["https://openalex.org/I5023651"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.1806194,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"21","issue":null,"first_page":"7","last_page":"12"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":1.0,"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":1.0,"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.9613999724388123,"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/T12791","display_name":"Full-Duplex Wireless Communications","score":0.9580000042915344,"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/subspace-topology","display_name":"Subspace topology","score":0.6734907627105713},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.6419304013252258},{"id":"https://openalex.org/keywords/concatenated-error-correction-code","display_name":"Concatenated error correction code","score":0.5828414559364319},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.56793212890625},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5558430552482605},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5289319157600403},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5046161413192749},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4771832227706909},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4518999755382538},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4299122095108032},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.41721397638320923},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34371984004974365},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.06097480654716492},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.05963936448097229}],"concepts":[{"id":"https://openalex.org/C32834561","wikidata":"https://www.wikidata.org/wiki/Q660730","display_name":"Subspace topology","level":2,"score":0.6734907627105713},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.6419304013252258},{"id":"https://openalex.org/C78944582","wikidata":"https://www.wikidata.org/wiki/Q5158264","display_name":"Concatenated error correction code","level":4,"score":0.5828414559364319},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.56793212890625},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5558430552482605},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5289319157600403},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5046161413192749},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4771832227706909},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4518999755382538},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4299122095108032},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.41721397638320923},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34371984004974365},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06097480654716492},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.05963936448097229},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/netcod.2012.6261876","is_oa":false,"landing_page_url":"https://doi.org/10.1109/netcod.2012.6261876","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 International Symposium on Network Coding (NetCod)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1506246257","https://openalex.org/W1554096626","https://openalex.org/W1568510176","https://openalex.org/W1993359877","https://openalex.org/W2055060019","https://openalex.org/W2095418648","https://openalex.org/W2098313715","https://openalex.org/W2098558858","https://openalex.org/W2103320637","https://openalex.org/W2105831729","https://openalex.org/W2106403318","https://openalex.org/W2107712595","https://openalex.org/W2129807739","https://openalex.org/W2130350209","https://openalex.org/W2138928022","https://openalex.org/W2139145447","https://openalex.org/W2139416652","https://openalex.org/W2158610833","https://openalex.org/W2534491645","https://openalex.org/W2895239415","https://openalex.org/W2912975828","https://openalex.org/W2964084534","https://openalex.org/W3101800757","https://openalex.org/W3103260357","https://openalex.org/W4230506308","https://openalex.org/W4233121052","https://openalex.org/W6633302848"],"related_works":["https://openalex.org/W2258031046","https://openalex.org/W2030775967","https://openalex.org/W1963637513","https://openalex.org/W2037763716","https://openalex.org/W1968396483","https://openalex.org/W4297536019","https://openalex.org/W2362406576","https://openalex.org/W2100149990","https://openalex.org/W2950636389","https://openalex.org/W2134931385"],"abstract_inverted_index":{"We":[0,30,110],"describe":[1,138],"a":[2,20,38,100,113,119],"novel":[3],"extension":[4],"of":[5,42,54,63,70,94,102,106,121],"subspace":[6,74,122,145],"codes":[7,71,123,126],"for":[8,12,143],"noncoherent":[9],"networks,":[10],"suitable":[11],"use":[13],"when":[14,33,51],"the":[15,48,52,55,61,64,67,78,92,95,103,107,133],"network":[16,49,84],"is":[17,57,127],"viewed":[18],"as":[19],"communication":[21],"system":[22],"that":[23,32,112,117],"introduces":[24],"both":[25],"dimension":[26],"and":[27,50,105,124],"symbol":[28,34],"errors.":[29],"show":[31,111],"erasures":[35],"occur":[36],"in":[37],"significantly":[39],"large":[40],"number":[41],"different":[43],"basis":[44],"vectors":[45],"transmitted":[46,65],"through":[47],"min-cut":[53],"networks":[56],"much":[58],"smaller":[59],"then":[60],"length":[62],"codewords,":[66],"new":[68],"family":[69],"outperforms":[72],"their":[73],"code":[75],"counterparts.":[76],"For":[77],"proposed":[79],"coding":[80],"scheme,":[81],"termed":[82],"hybrid":[83],"coding,":[85],"we":[86,137],"derive":[87],"two":[88,139],"upper":[89],"bounds":[90,98],"on":[91],"size":[93],"codes.":[96],"These":[97],"represent":[99],"variation":[101],"Singleton":[104,134],"sphere-packing":[108],"bound.":[109,135],"simple":[114],"concatenated":[115,144],"scheme":[116],"represents":[118],"combination":[120],"Reed-Solomon":[125],"asymptotically":[128],"optimal":[129],"with":[130],"respect":[131],"to":[132],"Finally,":[136],"efficient":[140],"decoding":[141],"algorithms":[142],"code.":[146]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}