{"id":"https://openalex.org/W4289655352","doi":"https://doi.org/10.1109/isit50566.2022.9834469","title":"A New Approach to Compute Information Theoretic Outer Bounds and Its Application to Regenerating Codes","display_name":"A New Approach to Compute Information Theoretic Outer Bounds and Its Application to Regenerating Codes","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4289655352","doi":"https://doi.org/10.1109/isit50566.2022.9834469"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834469","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834469","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 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/A5100430110","display_name":"Wenjing Chen","orcid":"https://orcid.org/0000-0002-4563-9807"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Wenjing Chen","raw_affiliation_strings":["Texas A&M University,Department of Electrical and Computer Engineering"],"affiliations":[{"raw_affiliation_string":"Texas A&M University,Department of Electrical and Computer Engineering","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100675045","display_name":"Chao Tian","orcid":"https://orcid.org/0000-0001-8752-6141"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chao Tian","raw_affiliation_strings":["Texas A&M University,Department of Electrical and Computer Engineering"],"affiliations":[{"raw_affiliation_string":"Texas A&M University,Department of Electrical and Computer Engineering","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100430110"],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":0.6479,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.57605673,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"2619","last_page":"2624"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","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/T11181","display_name":"Advanced Data Storage Technologies","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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9959999918937683,"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/T11269","display_name":"Algorithms and Data Compression","score":0.989300012588501,"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/computational-complexity-theory","display_name":"Computational complexity theory","score":0.7082787752151489},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6847776770591736},{"id":"https://openalex.org/keywords/computational-resource","display_name":"Computational resource","score":0.62720787525177},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.534477710723877},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.5049861073493958},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4881516098976135},{"id":"https://openalex.org/keywords/ingenuity","display_name":"Ingenuity","score":0.47189459204673767},{"id":"https://openalex.org/keywords/intuition","display_name":"Intuition","score":0.4670385718345642},{"id":"https://openalex.org/keywords/computational-problem","display_name":"Computational problem","score":0.46554645895957947},{"id":"https://openalex.org/keywords/computational-model","display_name":"Computational model","score":0.43080949783325195},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.4173327088356018},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36594778299331665},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23573359847068787}],"concepts":[{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.7082787752151489},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6847776770591736},{"id":"https://openalex.org/C127964446","wikidata":"https://www.wikidata.org/wiki/Q1092142","display_name":"Computational resource","level":3,"score":0.62720787525177},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.534477710723877},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.5049861073493958},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4881516098976135},{"id":"https://openalex.org/C2778154381","wikidata":"https://www.wikidata.org/wiki/Q105296908","display_name":"Ingenuity","level":2,"score":0.47189459204673767},{"id":"https://openalex.org/C132010649","wikidata":"https://www.wikidata.org/wiki/Q189222","display_name":"Intuition","level":2,"score":0.4670385718345642},{"id":"https://openalex.org/C19754495","wikidata":"https://www.wikidata.org/wiki/Q3435924","display_name":"Computational problem","level":2,"score":0.46554645895957947},{"id":"https://openalex.org/C66024118","wikidata":"https://www.wikidata.org/wiki/Q1122506","display_name":"Computational model","level":2,"score":0.43080949783325195},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.4173327088356018},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36594778299331665},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23573359847068787},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C133425853","wikidata":"https://www.wikidata.org/wiki/Q60571","display_name":"Neoclassical economics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit50566.2022.9834469","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834469","pdf_url":null,"source":{"id":"https://openalex.org/S4363604560","display_name":"2022 IEEE International Symposium on Information Theory (ISIT)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W646142101","https://openalex.org/W1515040589","https://openalex.org/W1636260479","https://openalex.org/W1645278014","https://openalex.org/W1703564471","https://openalex.org/W1995875735","https://openalex.org/W1999730868","https://openalex.org/W2037413426","https://openalex.org/W2058863419","https://openalex.org/W2099111195","https://openalex.org/W2105185344","https://openalex.org/W2106248279","https://openalex.org/W2114325434","https://openalex.org/W2150777202","https://openalex.org/W2268702383","https://openalex.org/W2409139038","https://openalex.org/W2547052808","https://openalex.org/W2599749253","https://openalex.org/W2611277399","https://openalex.org/W2757000692","https://openalex.org/W2885836992","https://openalex.org/W2961382438","https://openalex.org/W2962901739","https://openalex.org/W2962928269","https://openalex.org/W2963146528","https://openalex.org/W2963538770","https://openalex.org/W3080270214","https://openalex.org/W3081319578","https://openalex.org/W3100515187","https://openalex.org/W3105559639","https://openalex.org/W3106164725","https://openalex.org/W3106482607","https://openalex.org/W3122246509","https://openalex.org/W3131706158","https://openalex.org/W3197645223","https://openalex.org/W3208343908","https://openalex.org/W4214717370","https://openalex.org/W4294490771","https://openalex.org/W4300079393","https://openalex.org/W4300840296","https://openalex.org/W6637477579","https://openalex.org/W6691260708"],"related_works":["https://openalex.org/W2354102142","https://openalex.org/W2378302565","https://openalex.org/W2125016965","https://openalex.org/W2141467654","https://openalex.org/W1569631234","https://openalex.org/W4383863468","https://openalex.org/W4214707141","https://openalex.org/W15898768","https://openalex.org/W2751685088","https://openalex.org/W4391089860"],"abstract_inverted_index":{"The":[0,131],"study":[1],"of":[2,6,87,94,140],"the":[3,17,22,31,43,64,83,88,95,104,121,134,138,172,185,189,207],"fundamental":[4],"limits":[5],"information":[7,14,142],"systems":[8],"is":[9,33,99,137,156,202],"a":[10,58,109,146,157,165,180],"central":[11],"theme":[12],"in":[13,133,171],"theory.":[15],"Both":[16],"traditional":[18],"analytical":[19],"approach":[20,26,61],"and":[21,42,50,70,162,201],"recently":[23],"proposed":[24],"computational":[25,51,60,71,85,90,210],"have":[27],"significant":[28],"limitations,":[29],"where":[30],"former":[32],"mainly":[34],"due":[35,45],"to":[36,46,62,108,114,124,204],"its":[37,47],"reliance":[38],"on":[39],"human":[40],"ingenuity,":[41],"latter":[44],"exponential":[48],"memory":[49,69],"complexity.":[52],"In":[53],"this":[54],"work,":[55],"we":[56,163,178],"propose":[57],"new":[59,173],"tackle":[63],"problem":[65,98,136],"with":[66,144,206],"much":[67],"lower":[68],"requirements,":[72],"which":[73,102,119,145,194],"can":[74,81,149],"naturally":[75],"utilize":[76],"certain":[77],"intuitions,":[78],"but":[79],"also":[80],"maintain":[82],"strong":[84],"advantage":[86],"existing":[89],"approach.":[91,211],"A":[92,152],"reformulation":[93],"underlying":[96],"optimization":[97],"first":[100],"proposed,":[101],"converts":[103],"large":[105],"linear":[106],"program":[107],"maximin":[110],"problem.":[111],"This":[112],"leads":[113],"an":[115,176],"iterative":[116],"solving":[117],"procedure,":[118],"uses":[120],"LP":[122,148],"dual":[123],"carry":[125],"over":[126],"learned":[127],"evidence":[128],"between":[129],"iterations.":[130],"key":[132],"reformulated":[135],"selection":[139],"good":[141],"inequalities,":[143],"relaxed":[147],"be":[150],"formed.":[151],"particularly":[153],"powerful":[154],"intuition":[155],"potentially":[158],"optimal":[159],"code":[160,192],"construction,":[161],"provide":[164],"method":[166],"that":[167],"directly":[168],"utilizes":[169],"it":[170],"algorithm.":[174],"As":[175],"application,":[177],"derive":[179],"tighter":[181],"outer":[182],"bound":[183],"for":[184,188],"storage-repair":[186],"tradeoff":[187],"(6,5,5)":[190],"regenerating":[191],"problem,":[193],"involves":[195],"at":[196],"least":[197],"30":[198],"random":[199],"variables":[200],"impossible":[203],"compute":[205],"previously":[208],"known":[209]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}