{"id":"https://openalex.org/W2178307079","doi":"https://doi.org/10.1109/isit.2012.6283512","title":"A matroidal framework for network-error correcting codes","display_name":"A matroidal framework for network-error correcting codes","publication_year":2012,"publication_date":"2012-07-01","ids":{"openalex":"https://openalex.org/W2178307079","doi":"https://doi.org/10.1109/isit.2012.6283512","mag":"2178307079"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2012.6283512","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2012.6283512","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Symposium on Information Theory Proceedings","raw_type":"proceedings-article"},"type":"preprint","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/A5001685956","display_name":"Prasad Krishnan","orcid":"https://orcid.org/0000-0001-9182-6278"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"K. Prasad","raw_affiliation_strings":["Department of ECE, IISc, Bangalore, India"],"affiliations":[{"raw_affiliation_string":"Department of ECE, IISc, Bangalore, India","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5015398340","display_name":"B. Sundar Rajan","orcid":"https://orcid.org/0000-0002-7847-0200"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"B. Sundar Rajan","raw_affiliation_strings":["Department of ECE, IISc, Bangalore, India"],"affiliations":[{"raw_affiliation_string":"Department of ECE, IISc, Bangalore, India","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5001685956"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4901,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.84774663,"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":"1493","last_page":"1497"},"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.9998999834060669,"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.9998999834060669,"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/T12791","display_name":"Full-Duplex Wireless Communications","score":0.9854000210762024,"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"}},{"id":"https://openalex.org/T11458","display_name":"Advanced Wireless Communication Technologies","score":0.9815999865531921,"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/matroid","display_name":"Matroid","score":0.9361945986747742},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.621360719203949},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5431723594665527},{"id":"https://openalex.org/keywords/scalar","display_name":"Scalar (mathematics)","score":0.47448065876960754},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4545707702636719},{"id":"https://openalex.org/keywords/hamming-bound","display_name":"Hamming bound","score":0.4406798779964447},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.438317209482193},{"id":"https://openalex.org/keywords/coding-theory","display_name":"Coding theory","score":0.4193892478942871},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3985767662525177},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3539764881134033},{"id":"https://openalex.org/keywords/block-code","display_name":"Block code","score":0.352449893951416},{"id":"https://openalex.org/keywords/linear-code","display_name":"Linear code","score":0.33768221735954285},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.17433586716651917},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.06623604893684387}],"concepts":[{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.9361945986747742},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.621360719203949},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5431723594665527},{"id":"https://openalex.org/C57691317","wikidata":"https://www.wikidata.org/wiki/Q1289248","display_name":"Scalar (mathematics)","level":2,"score":0.47448065876960754},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4545707702636719},{"id":"https://openalex.org/C166530166","wikidata":"https://www.wikidata.org/wiki/Q1970635","display_name":"Hamming bound","level":5,"score":0.4406798779964447},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.438317209482193},{"id":"https://openalex.org/C113709454","wikidata":"https://www.wikidata.org/wiki/Q602136","display_name":"Coding theory","level":2,"score":0.4193892478942871},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3985767662525177},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3539764881134033},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.352449893951416},{"id":"https://openalex.org/C2400350","wikidata":"https://www.wikidata.org/wiki/Q1752667","display_name":"Linear code","level":4,"score":0.33768221735954285},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.17433586716651917},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.06623604893684387},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/isit.2012.6283512","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2012.6283512","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Symposium on Information Theory Proceedings","raw_type":"proceedings-article"},{"id":"pmh:oai:eprints.iisc.ac.in:47927","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4377196309","display_name":"NOT FOUND REPOSITORY (Indian Institute of Science Bangalore)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I59270414","host_organization_name":"Indian Institute of Science Bangalore","host_organization_lineage":["https://openalex.org/I59270414"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"","raw_type":"Conference Paper"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.342.9813","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.342.9813","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.760.6814","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.760.6814","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1201.6459.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320310071","display_name":"Indian Institute of Science","ror":"https://ror.org/04dese585"},{"id":"https://openalex.org/F4320321024","display_name":"Defence Research and Development Organisation","ror":"https://ror.org/05k37v296"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W785083160","https://openalex.org/W2048235391","https://openalex.org/W2078535861","https://openalex.org/W2083270107","https://openalex.org/W2097149049","https://openalex.org/W2100450800","https://openalex.org/W2103320637","https://openalex.org/W2105831729","https://openalex.org/W2106403318","https://openalex.org/W2118456153","https://openalex.org/W2119407552","https://openalex.org/W2123562143","https://openalex.org/W2132123317","https://openalex.org/W2138928022","https://openalex.org/W2149286354","https://openalex.org/W2155501824","https://openalex.org/W2156053652","https://openalex.org/W2167703619","https://openalex.org/W2169558854","https://openalex.org/W2176518791","https://openalex.org/W2178307079","https://openalex.org/W2548899115","https://openalex.org/W3101008197"],"related_works":["https://openalex.org/W2737561264","https://openalex.org/W2614506317","https://openalex.org/W2964136540","https://openalex.org/W2184059163","https://openalex.org/W1665788294","https://openalex.org/W2390704486","https://openalex.org/W4255665992","https://openalex.org/W2182313064","https://openalex.org/W2963553930","https://openalex.org/W2731597386"],"abstract_inverted_index":{"Matroidal":[0],"networks":[1],"were":[2],"introduced":[3],"by":[4],"Dougherty":[5],"et":[6],"al.":[7],"and":[8,31,53,66,109,142],"have":[9],"been":[10],"well":[11],"studied":[12],"in":[13],"the":[14,62,71,81,131],"recent":[15],"past.":[16],"It":[17],"was":[18],"shown":[19,98],"that":[20,137],"a":[21,24,39,48,58,84,101,114,121],"network":[22,27,67,91,106,118],"has":[23],"scalar":[25,102],"linear":[26,103],"coding":[28],"solution":[29],"if":[30,33,108,111],"only":[32,110],"it":[34,112],"is":[35,96,113],"matroidal":[36,85,115],"associated":[37,119],"with":[38,120],"representable":[40,122,135],"matroid.":[41,123],"The":[42],"current":[43],"work":[44],"attempts":[45],"to":[46,61,78,99],"establish":[47],"connection":[49],"between":[50],"matroid":[51],"theory":[52,63],"network-error":[54,75,127],"correcting":[55,76,87,105,117,128],"codes.":[56],"In":[57],"similar":[59],"vein":[60],"connecting":[64],"matroids":[65,136],"coding,":[68],"we":[69],"abstract":[70],"essential":[72],"aspects":[73],"of":[74,83,133],"codes":[77,129],"arrive":[79],"at":[80],"definition":[82],"error":[86,104,116],"network.":[88],"An":[89],"acyclic":[90],"(with":[92],"arbitrary":[93],"sink":[94],"demands)":[95],"then":[97],"possess":[100],"code":[107],"Therefore,":[124],"constructing":[125],"such":[126],"implies":[130],"construction":[132],"certain":[134],"satisfy":[138],"some":[139],"special":[140],"conditions,":[141],"vice":[143],"versa.":[144]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}