{"id":"https://openalex.org/W2165822428","doi":"https://doi.org/10.1109/tit.2011.2111890","title":"The Minimal Set of Ingleton Inequalities","display_name":"The Minimal Set of Ingleton Inequalities","publication_year":2011,"publication_date":"2011-03-15","ids":{"openalex":"https://openalex.org/W2165822428","doi":"https://doi.org/10.1109/tit.2011.2111890","mag":"2165822428"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2011.2111890","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2011.2111890","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":["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/A5068391854","display_name":"Laurent Guille","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"L Guille","raw_affiliation_strings":["Ecole Nationale Sup\u00e9rieure des T\u00e9I\u00e9communications, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ecole Nationale Sup\u00e9rieure des T\u00e9I\u00e9communications, France","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5010336848","display_name":"Terence Chan","orcid":"https://orcid.org/0000-0002-6550-7203"},"institutions":[{"id":"https://openalex.org/I170239107","display_name":"University of South Australia","ror":"https://ror.org/01p93h210","country_code":"AU","type":"education","lineage":["https://openalex.org/I170239107"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"T Chan","raw_affiliation_strings":["Institute for Telecommunications Research, University of South Australia, Adelaide, SA, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Telecommunications Research, University of South Australia, Adelaide, SA, Australia","institution_ids":["https://openalex.org/I170239107"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072485708","display_name":"Alex Grant","orcid":"https://orcid.org/0000-0002-5345-7771"},"institutions":[{"id":"https://openalex.org/I170239107","display_name":"University of South Australia","ror":"https://ror.org/01p93h210","country_code":"AU","type":"education","lineage":["https://openalex.org/I170239107"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"A Grant","raw_affiliation_strings":["Institute for Telecommunications Research, University of South Australia, Adelaide, SA, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Telecommunications Research, University of South Australia, Adelaide, SA, Australia","institution_ids":["https://openalex.org/I170239107"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.6075,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.9310769,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"57","issue":"4","first_page":"1849","last_page":"1864"},"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"}},{"id":"https://openalex.org/T11458","display_name":"Advanced Wireless Communication Technologies","score":0.9819999933242798,"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/T11130","display_name":"Coding theory and cryptography","score":0.9693999886512756,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/matroid","display_name":"Matroid","score":0.6418048143386841},{"id":"https://openalex.org/keywords/linear-subspace","display_name":"Linear subspace","score":0.5834154486656189},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5290457606315613},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46904808282852173},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4273390769958496},{"id":"https://openalex.org/keywords/inequality","display_name":"Inequality","score":0.4155641496181488},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4131161868572235},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4117831587791443},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3695732355117798},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3202868700027466},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.14772403240203857},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.13377749919891357}],"concepts":[{"id":"https://openalex.org/C106286213","wikidata":"https://www.wikidata.org/wiki/Q898572","display_name":"Matroid","level":2,"score":0.6418048143386841},{"id":"https://openalex.org/C12362212","wikidata":"https://www.wikidata.org/wiki/Q728435","display_name":"Linear subspace","level":2,"score":0.5834154486656189},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5290457606315613},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46904808282852173},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4273390769958496},{"id":"https://openalex.org/C45555294","wikidata":"https://www.wikidata.org/wiki/Q28113351","display_name":"Inequality","level":2,"score":0.4155641496181488},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4131161868572235},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4117831587791443},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3695732355117798},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3202868700027466},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.14772403240203857},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.13377749919891357},{"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/tit.2011.2111890","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2011.2111890","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W646142101","https://openalex.org/W1515040589","https://openalex.org/W1588284605","https://openalex.org/W2000680242","https://openalex.org/W2026482663","https://openalex.org/W2100312180","https://openalex.org/W2103320637","https://openalex.org/W2105831729","https://openalex.org/W2106403318","https://openalex.org/W2113940092","https://openalex.org/W2114325434","https://openalex.org/W2115602633","https://openalex.org/W2122093339","https://openalex.org/W2123754181","https://openalex.org/W2132219316","https://openalex.org/W2147101953","https://openalex.org/W2147681281","https://openalex.org/W2161024633","https://openalex.org/W2164554299","https://openalex.org/W4297802579","https://openalex.org/W6678284995"],"related_works":["https://openalex.org/W2058299944","https://openalex.org/W4323360720","https://openalex.org/W1550144461","https://openalex.org/W2783959783","https://openalex.org/W2602164040","https://openalex.org/W2037206237","https://openalex.org/W4310658774","https://openalex.org/W2033011390","https://openalex.org/W2068222471","https://openalex.org/W2381226549"],"abstract_inverted_index":{"The":[0,118],"Ingleton":[1,42,99,124],"inequalities":[2,31,55,74,100,125],"are":[3,19,32,56,94],"the":[4,37,47,59,84,92,109,132],"inequality":[5],"constraints":[6,77],"known":[7],"to":[8,96,129],"be":[9,97],"required":[10,57,95],"of":[11,29,41,49,58,62,87,111,134],"representable":[12],"matroids.":[13],"For":[14],"a":[15,71],"matroid":[16],"ofnelements,":[17],"there":[18],"16nIngleton":[20],"inequalities.":[21],"In":[22,51],"this":[23],"paper,":[24],"we":[25,121],"show":[26],"that":[27,120],"many":[28],"these":[30,54,73,135],"redundant.":[33],"We":[34],"explicitly":[35],"determine":[36],"unique":[38],"minimal":[39],"set":[40],"inequalities,":[43],"which":[44],"number":[45],"on":[46],"order":[48],"6n/4-O(5n).":[50],"information":[52],"theory,":[53],"entropy":[60],"functions":[61],"certain":[63],"random":[64],"variables":[65],"constructed":[66],"from":[67],"linear":[68,79,112,136],"subspaces.":[69],"As":[70],"result,":[72],"appear":[75],"as":[76],"in":[78,107],"programming":[80,137],"outer":[81],"bounds":[82],"for":[83,114,123],"capacity":[85],"region":[86],"multisource":[88,115],"network":[89,116],"coding":[90],"where":[91],"codes":[93,113],"linear.":[98],"have":[101],"also":[102],"played":[103],"an":[104],"instrumental":[105],"role":[106],"demonstrating":[108],"insufficiency":[110],"coding.":[117],"reduction":[119],"obtain":[122],"is":[126],"sufficiently":[127],"large":[128],"meaningfully":[130],"reduce":[131],"complexity":[133],"bounds.":[138]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":4},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}