{"id":"https://openalex.org/W3080107369","doi":"https://doi.org/10.1109/isit44484.2020.9174493","title":"Linear Network Error Correction Coding Revisited","display_name":"Linear Network Error Correction Coding Revisited","publication_year":2020,"publication_date":"2020-06-01","ids":{"openalex":"https://openalex.org/W3080107369","doi":"https://doi.org/10.1109/isit44484.2020.9174493","mag":"3080107369"},"language":"en","primary_location":{"id":"doi:10.1109/isit44484.2020.9174493","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit44484.2020.9174493","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 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/A5027528912","display_name":"Xuan Guang","orcid":"https://orcid.org/0000-0002-0928-421X"},"institutions":[{"id":"https://openalex.org/I205237279","display_name":"Nankai University","ror":"https://ror.org/01y1kjr75","country_code":"CN","type":"education","lineage":["https://openalex.org/I205237279"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Xuan Guang","raw_affiliation_strings":["Nankai University,School of Mathematical Sciences and LPMC,Tianjin,China","School of Mathematical Sciences and LPMC, Nankai University, Tianjin, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Nankai University,School of Mathematical Sciences and LPMC,Tianjin,China","institution_ids":["https://openalex.org/I205237279"]},{"raw_affiliation_string":"School of Mathematical Sciences and LPMC, Nankai University, Tianjin, China","institution_ids":["https://openalex.org/I205237279"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038760786","display_name":"Raymond W. Yeung","orcid":"https://orcid.org/0000-0001-7386-4027"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"HK","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Raymond W. Yeung","raw_affiliation_strings":["The Chinese University of Hong Kong,Institute of Network Coding and Department of Information Engineering,Hong Kong SAR,China","Institute of Network Coding and Department of Information Engineering, The Chinese University of Hong Kong, Hong Kong SAR, China"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Chinese University of Hong Kong,Institute of Network Coding and Department of Information Engineering,Hong Kong SAR,China","institution_ids":["https://openalex.org/I177725633"]},{"raw_affiliation_string":"Institute of Network Coding and Department of Information Engineering, The Chinese University of Hong Kong, Hong Kong SAR, China","institution_ids":["https://openalex.org/I177725633"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4862,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.68352714,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1635","last_page":"1640"},"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.9997000098228455,"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.9997000098228455,"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/linear-network-coding","display_name":"Linear network coding","score":0.8178874850273132},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.6394964456558228},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6378938555717468},{"id":"https://openalex.org/keywords/variable-length-code","display_name":"Variable-length code","score":0.6246417164802551},{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.6169425845146179},{"id":"https://openalex.org/keywords/shannon\u2013fano-coding","display_name":"Shannon\u2013Fano coding","score":0.5750479102134705},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5264059901237488},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4833900034427643},{"id":"https://openalex.org/keywords/coding-gain","display_name":"Coding gain","score":0.4301309883594513},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4154168367385864},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28192487359046936},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.22609955072402954},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07364961504936218}],"concepts":[{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.8178874850273132},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.6394964456558228},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6378938555717468},{"id":"https://openalex.org/C60603091","wikidata":"https://www.wikidata.org/wiki/Q2981616","display_name":"Variable-length code","level":3,"score":0.6246417164802551},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.6169425845146179},{"id":"https://openalex.org/C130811719","wikidata":"https://www.wikidata.org/wiki/Q2645","display_name":"Shannon\u2013Fano coding","level":4,"score":0.5750479102134705},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5264059901237488},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4833900034427643},{"id":"https://openalex.org/C76862118","wikidata":"https://www.wikidata.org/wiki/Q1105671","display_name":"Coding gain","level":3,"score":0.4301309883594513},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4154168367385864},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28192487359046936},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.22609955072402954},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07364961504936218},{"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/isit44484.2020.9174493","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit44484.2020.9174493","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2020 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":16,"referenced_works":["https://openalex.org/W108696806","https://openalex.org/W785083160","https://openalex.org/W2042474604","https://openalex.org/W2055060019","https://openalex.org/W2083270107","https://openalex.org/W2083315413","https://openalex.org/W2118456153","https://openalex.org/W2139416652","https://openalex.org/W2157328738","https://openalex.org/W2404362146","https://openalex.org/W2534491645","https://openalex.org/W2557793327","https://openalex.org/W3101008197","https://openalex.org/W4300079393","https://openalex.org/W6622506867","https://openalex.org/W6728374566"],"related_works":["https://openalex.org/W4312628177","https://openalex.org/W2148686647","https://openalex.org/W2262362834","https://openalex.org/W1485515172","https://openalex.org/W2104750217","https://openalex.org/W2548599468","https://openalex.org/W1997045285","https://openalex.org/W2147544396","https://openalex.org/W2109115525","https://openalex.org/W2371742128"],"abstract_inverted_index":{"We":[0],"consider":[1],"linear":[2],"network":[3,18],"error":[4],"correction":[5],"(LNEC)":[6],"coding":[7,44,100],"when":[8],"errors":[9],"may":[10],"occur":[11],"on":[12,119],"the":[13,21,33,64,70,96,120,132,142,146,158],"edges":[14],"of":[15,19,35,58,72,82,87,98,104,148,157,160,166],"a":[16,56,126,153],"communication":[17],"which":[20],"topology":[22],"is":[23,76,92,135],"known.":[24],"In":[25,46,110],"this":[26,111],"paper,":[27,112],"we":[28,113,151],"first":[29],"revisit":[30],"and":[31,38,107],"explore":[32],"framework":[34,147],"LNEC":[36,43,47,49,73,149,162],"coding,":[37,48,150],"then":[39],"unify":[40],"two":[41],"well-known":[42],"approaches.":[45],"maximum":[50],"distance":[51],"separable":[52],"(MDS)":[53],"codes":[54,75],"are":[55],"type":[57],"most":[59],"important":[60],"optimal":[61],"codes.":[62],"However,":[63],"minimum":[65,168],"required":[66,121],"field":[67,122],"size":[68,123],"for":[69],"existence":[71],"MDS":[74],"an":[77,115,161],"open":[78],"problem":[79],"not":[80],"only":[81],"theoretical":[83],"interest":[84],"but":[85],"also":[86],"practical":[88],"importance,":[89],"because":[90],"it":[91],"closely":[93],"related":[94],"to":[95,145],"implementation":[97],"such":[99],"schemes":[101],"in":[102,136,164],"terms":[103,165],"computational":[105],"complexity":[106],"storage":[108],"requirement.":[109],"obtain":[114,152],"improved":[116],"lower":[117],"bound":[118],"by":[124,140],"developing":[125],"graph-theoretic":[127,143],"approach.":[128],"The":[129],"improvement":[130],"over":[131],"existing":[133],"results":[134],"general":[137],"significant.":[138],"Furthermore,":[139],"applying":[141],"approach":[144],"significantly":[154],"enhanced":[155],"characterization":[156],"capability":[159],"code":[163],"its":[167],"distance.":[169]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}