{"id":"https://openalex.org/W4289713089","doi":"https://doi.org/10.1109/isit50566.2022.9834821","title":"Blahut-Arimoto Algorithms for Computing Capacity Bounds of Broadcast Channels","display_name":"Blahut-Arimoto Algorithms for Computing Capacity Bounds of Broadcast Channels","publication_year":2022,"publication_date":"2022-06-26","ids":{"openalex":"https://openalex.org/W4289713089","doi":"https://doi.org/10.1109/isit50566.2022.9834821"},"language":"en","primary_location":{"id":"doi:10.1109/isit50566.2022.9834821","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834821","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/A5100360935","display_name":"Yanqing Liu","orcid":"https://orcid.org/0000-0003-0412-8805"},"institutions":[{"id":"https://openalex.org/I149594827","display_name":"Xidian University","ror":"https://ror.org/05s92vm98","country_code":"CN","type":"education","lineage":["https://openalex.org/I149594827"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yanqing Liu","raw_affiliation_strings":["Xidian University,State Key Laboratory of ISN,China","State Key Laboratory of ISN, Xidian University, China"],"affiliations":[{"raw_affiliation_string":"Xidian University,State Key Laboratory of ISN,China","institution_ids":["https://openalex.org/I149594827"]},{"raw_affiliation_string":"State Key Laboratory of ISN, Xidian University, China","institution_ids":["https://openalex.org/I149594827"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5090182646","display_name":"Yanlin Geng","orcid":"https://orcid.org/0000-0002-4451-7242"},"institutions":[{"id":"https://openalex.org/I149594827","display_name":"Xidian University","ror":"https://ror.org/05s92vm98","country_code":"CN","type":"education","lineage":["https://openalex.org/I149594827"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yanlin Geng","raw_affiliation_strings":["Xidian University,State Key Laboratory of ISN,China","State Key Laboratory of ISN, Xidian University, China"],"affiliations":[{"raw_affiliation_string":"Xidian University,State Key Laboratory of ISN,China","institution_ids":["https://openalex.org/I149594827"]},{"raw_affiliation_string":"State Key Laboratory of ISN, Xidian University, China","institution_ids":["https://openalex.org/I149594827"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100360935"],"corresponding_institution_ids":["https://openalex.org/I149594827"],"apc_list":null,"apc_paid":null,"fwci":0.8642,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.66648222,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1145","last_page":"1150"},"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.9998000264167786,"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.9998000264167786,"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/T10964","display_name":"Wireless Communication Security Techniques","score":0.9991999864578247,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9955999851226807,"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/hyperplane","display_name":"Hyperplane","score":0.7713372707366943},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.5715461373329163},{"id":"https://openalex.org/keywords/convexity","display_name":"Convexity","score":0.546829104423523},{"id":"https://openalex.org/keywords/superposition-principle","display_name":"Superposition principle","score":0.487454891204834},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4828491806983948},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4798250198364258},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4737556576728821},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46938344836235046},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.43677759170532227},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43567758798599243},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3379251956939697},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3203697204589844},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.24189123511314392}],"concepts":[{"id":"https://openalex.org/C68693459","wikidata":"https://www.wikidata.org/wiki/Q657586","display_name":"Hyperplane","level":2,"score":0.7713372707366943},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.5715461373329163},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.546829104423523},{"id":"https://openalex.org/C27753989","wikidata":"https://www.wikidata.org/wiki/Q284885","display_name":"Superposition principle","level":2,"score":0.487454891204834},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4828491806983948},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4798250198364258},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4737556576728821},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46938344836235046},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.43677759170532227},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43567758798599243},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3379251956939697},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3203697204589844},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.24189123511314392},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"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/C106159729","wikidata":"https://www.wikidata.org/wiki/Q2294553","display_name":"Financial economics","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit50566.2022.9834821","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit50566.2022.9834821","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":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1494926642","https://openalex.org/W1978188352","https://openalex.org/W1983553253","https://openalex.org/W2029236670","https://openalex.org/W2031519636","https://openalex.org/W2094458162","https://openalex.org/W2123577883","https://openalex.org/W2128461347","https://openalex.org/W2148986322","https://openalex.org/W2161405788","https://openalex.org/W2296441616","https://openalex.org/W2531210068","https://openalex.org/W2899569130","https://openalex.org/W2978814959","https://openalex.org/W3213147405","https://openalex.org/W4300840296"],"related_works":["https://openalex.org/W3205718857","https://openalex.org/W2050230854","https://openalex.org/W2149714571","https://openalex.org/W2950535529","https://openalex.org/W582641449","https://openalex.org/W4297913896","https://openalex.org/W2101210333","https://openalex.org/W2085869002","https://openalex.org/W4235874751","https://openalex.org/W4282913468"],"abstract_inverted_index":{"The":[0],"computation":[1],"of":[2,10,19,27,42,56,64],"inner":[3,58],"and":[4,60],"outer":[5,66],"bounds":[6],"on":[7],"capacity":[8],"regions":[9],"broadcast":[11],"channels":[12],"is":[13],"difficult":[14],"due":[15],"to":[16,37,52],"the":[17,25,39,43,50,54,61],"non-convexity":[18],"expressions.":[20],"In":[21],"this":[22],"work,":[23],"with":[24],"help":[26],"a":[28,34],"Terkelsen-type":[29],"minimax":[30],"theorem,":[31],"we":[32,48],"develop":[33],"Blahut-Arimoto":[35],"algorithm":[36,51],"evaluate":[38],"supporting":[40,62],"hyperplanes":[41,63],"superposition":[44],"coding":[45],"region.":[46],"Then":[47],"extend":[49],"calculate":[53],"sum-rate":[55],"Marton\u2019s":[57],"bound,":[59],"UV":[65],"bound.":[67]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2}],"updated_date":"2026-03-14T06:41:57.775601","created_date":"2025-10-10T00:00:00"}