{"id":"https://openalex.org/W2161718996","doi":"https://doi.org/10.1109/itwitwn.2007.4318051","title":"Normalized Entropy Vectors, Network Information Theory and Convex Optimization","display_name":"Normalized Entropy Vectors, Network Information Theory and Convex Optimization","publication_year":2007,"publication_date":"2007-07-01","ids":{"openalex":"https://openalex.org/W2161718996","doi":"https://doi.org/10.1109/itwitwn.2007.4318051","mag":"2161718996"},"language":"en","primary_location":{"id":"doi:10.1109/itwitwn.2007.4318051","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itwitwn.2007.4318051","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks","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/A5002430773","display_name":"Babak Hassibi","orcid":"https://orcid.org/0000-0002-1375-5838"},"institutions":[{"id":"https://openalex.org/I122411786","display_name":"California Institute of Technology","ror":"https://ror.org/05dxps055","country_code":"US","type":"education","lineage":["https://openalex.org/I122411786"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Babak Hassibi","raw_affiliation_strings":["Department of Electrical Engineering, California Institute of Technology, Pasadena, CA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, California Institute of Technology, Pasadena, CA, USA","institution_ids":["https://openalex.org/I122411786"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007314466","display_name":"Sormeh Shadbakht","orcid":null},"institutions":[{"id":"https://openalex.org/I122411786","display_name":"California Institute of Technology","ror":"https://ror.org/05dxps055","country_code":"US","type":"education","lineage":["https://openalex.org/I122411786"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sormeh Shadbakht","raw_affiliation_strings":["Department of Electrical Engineering, California Institute of Technology, Pasadena, CA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, California Institute of Technology, Pasadena, CA, USA","institution_ids":["https://openalex.org/I122411786"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5002430773"],"corresponding_institution_ids":["https://openalex.org/I122411786"],"apc_list":null,"apc_paid":null,"fwci":3.5899,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.92946569,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9986000061035156,"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"}},"topics":[{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9986000061035156,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9902999997138977,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9840999841690063,"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/entropy","display_name":"Entropy (arrow of time)","score":0.6009734869003296},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5978094339370728},{"id":"https://openalex.org/keywords/entropy-maximization","display_name":"Entropy maximization","score":0.5391737222671509},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5373830199241638},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.4683750569820404},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.4421389400959015},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.43938177824020386},{"id":"https://openalex.org/keywords/information-theory","display_name":"Information theory","score":0.43481236696243286},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.42884552478790283},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3964085876941681},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.39173221588134766},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3894020915031433},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.339092880487442},{"id":"https://openalex.org/keywords/principle-of-maximum-entropy","display_name":"Principle of maximum entropy","score":0.18703162670135498}],"concepts":[{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.6009734869003296},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5978094339370728},{"id":"https://openalex.org/C127233936","wikidata":"https://www.wikidata.org/wiki/Q1417473","display_name":"Entropy maximization","level":3,"score":0.5391737222671509},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5373830199241638},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.4683750569820404},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.4421389400959015},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.43938177824020386},{"id":"https://openalex.org/C52622258","wikidata":"https://www.wikidata.org/wiki/Q131222","display_name":"Information theory","level":2,"score":0.43481236696243286},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.42884552478790283},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3964085876941681},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39173221588134766},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3894020915031433},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.339092880487442},{"id":"https://openalex.org/C9679016","wikidata":"https://www.wikidata.org/wiki/Q1417473","display_name":"Principle of maximum entropy","level":2,"score":0.18703162670135498},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/itwitwn.2007.4318051","is_oa":false,"landing_page_url":"https://doi.org/10.1109/itwitwn.2007.4318051","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 IEEE Information Theory Workshop on Information Theory for Wireless Networks","raw_type":"proceedings-article"},{"id":"pmh:oai:authors.library.caltech.edu:8911","is_oa":false,"landing_page_url":"https://authors.library.caltech.edu/8911/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402161","display_name":"CaltechAUTHORS (California Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I122411786","host_organization_name":"California Institute of Technology","host_organization_lineage":["https://openalex.org/I122411786"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Book Section"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.152.7562","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.152.7562","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://authors.library.caltech.edu/8911/1/HASitwitwn07.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5699999928474426,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W1515040589","https://openalex.org/W2002531683","https://openalex.org/W2099111195","https://openalex.org/W2113758011","https://openalex.org/W2129885443","https://openalex.org/W2135298608","https://openalex.org/W2140678653","https://openalex.org/W2147681281","https://openalex.org/W2154501376","https://openalex.org/W4213060883"],"related_works":["https://openalex.org/W3102188974","https://openalex.org/W3004810941","https://openalex.org/W4287870705","https://openalex.org/W3199097846","https://openalex.org/W4297193174","https://openalex.org/W2576492542","https://openalex.org/W1952656308","https://openalex.org/W2267645079","https://openalex.org/W2144260821","https://openalex.org/W2137556923"],"abstract_inverted_index":{"We":[0,28,165],"introduce":[1],"the":[2,10,14,22,25,38,50,53,61,64,71,74,87,101,122,140,146,153,160,163,168,174,183,199,217],"notion":[3],"of":[4,24,41,52,55,63,73,97,108,117,125,155,162,201],"normalized":[5,127,203],"entropic":[6,128,204],"vectors-slightly":[7],"different":[8],"from":[9],"standard":[11],"definition":[12,32],"in":[13,16,44,216],"literature":[15],"that":[17,30,46,167],"we":[18],"normalize":[19],"entropy":[20,57],"by":[21,82,115],"logarithm":[23],"alphabet":[26],"size.":[27],"argue":[29],"this":[31,135],"is":[33],"more":[34],"natural":[35],"for":[36,93,104,188],"determining":[37],"capacity":[39,102],"region":[40,103],"networks":[42],"and,":[43],"particular,":[45],"it":[47,143],"smooths":[48],"out":[49],"irregularities":[51],"space":[54,66,75,200],"non-normalized":[56],"vectors":[58,129],"and":[59,110,130,158,209],"renders":[60],"closure":[62,72],"resulting":[65],"convex":[67,77,123],"(and":[68],"compact).":[69],"Furthermore,":[70,182],"remains":[76],"even":[78],"under":[79],"constraints":[80],"imposed":[81],"memoryless":[83,99,190],"channels":[84],"internal":[85],"to":[86,172],"network.":[88],"It":[89],"therefore":[90],"follows":[91],"that,":[92,187],"a":[94,118,179],"large":[95],"class":[96],"acyclic":[98,189],"networks,":[100,194],"an":[105],"arbitrary":[106],"set":[107,124],"sources":[109],"destinations":[111],"can":[112],"be":[113],"found":[114],"maximization":[116],"linear":[119,132],"function":[120],"over":[121],"channel-constrained":[126],"some":[131],"constraints.":[133],"While":[134],"may":[136],"not":[137],"necessarily":[138],"make":[139],"problem":[141],"simpler,":[142],"certainly":[144],"circumvents":[145],"\"infinite-letter":[147],"characterization\"":[148],"issue,":[149],"as":[150,152],"well":[151],"nonconvexity":[154],"earlier":[156],"formulations,":[157],"exposes":[159],"core":[161],"problem.":[164],"show":[166],"approach":[169,184],"allows":[170],"one":[171,195],"obtain":[173],"classical":[175],"cutset":[176],"bounds":[177],"via":[178],"duality":[180],"argument.":[181],"readily":[185],"shows":[186],"<i":[191],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[192],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">wired</i>":[193],"need":[196],"only":[197],"consider":[198],"unconstrained":[202],"vectors,":[205],"thus":[206],"separating":[207],"channel":[208],"network":[210],"coding\u2014a":[211],"result":[212],"very":[213],"recently":[214],"recognized":[215],"literature.":[218]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}