{"id":"https://openalex.org/W1969588416","doi":"https://doi.org/10.1109/isit.2014.6874836","title":"On the second-order cost of TDMA for Gaussian multiple access","display_name":"On the second-order cost of TDMA for Gaussian multiple access","publication_year":2014,"publication_date":"2014-06-01","ids":{"openalex":"https://openalex.org/W1969588416","doi":"https://doi.org/10.1109/isit.2014.6874836","mag":"1969588416"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2014.6874836","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6874836","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Symposium on Information Theory","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/A5049811638","display_name":"Ebrahim MolavianJazi","orcid":"https://orcid.org/0000-0003-3606-8333"},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ebrahim MolavianJazi","raw_affiliation_strings":["Department of Electrical Engineering, University of Notre Dame","[Dept. of Electr. Eng., Univ. of Notre Dame, Notre Dame, IN, USA]"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Notre Dame","institution_ids":["https://openalex.org/I107639228"]},{"raw_affiliation_string":"[Dept. of Electr. Eng., Univ. of Notre Dame, Notre Dame, IN, USA]","institution_ids":["https://openalex.org/I107639228"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076363259","display_name":"J. Nicholas Laneman","orcid":null},"institutions":[{"id":"https://openalex.org/I107639228","display_name":"University of Notre Dame","ror":"https://ror.org/00mkhxb43","country_code":"US","type":"education","lineage":["https://openalex.org/I107639228"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J. Nicholas Laneman","raw_affiliation_strings":["Department of Electrical Engineering, University of Notre Dame","[Dept. of Electr. Eng., Univ. of Notre Dame, Notre Dame, IN, USA]"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Notre Dame","institution_ids":["https://openalex.org/I107639228"]},{"raw_affiliation_string":"[Dept. of Electr. Eng., Univ. of Notre Dame, Notre Dame, IN, USA]","institution_ids":["https://openalex.org/I107639228"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5049811638"],"corresponding_institution_ids":["https://openalex.org/I107639228"],"apc_list":null,"apc_paid":null,"fwci":0.8373,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.75961509,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"266","last_page":"270"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9998999834060669,"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.9998999834060669,"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/T12879","display_name":"Distributed Sensor Networks and Detection Algorithms","score":0.9961000084877014,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9933000206947327,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/time-division-multiple-access","display_name":"Time division multiple access","score":0.9532251358032227},{"id":"https://openalex.org/keywords/gaussian","display_name":"Gaussian","score":0.6307861804962158},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6131476759910583},{"id":"https://openalex.org/keywords/random-access","display_name":"Random access","score":0.5415123105049133},{"id":"https://openalex.org/keywords/multi-frequency-time-division-multiple-access","display_name":"Multi-frequency time division multiple access","score":0.5105644464492798},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.49546968936920166},{"id":"https://openalex.org/keywords/dirty-paper-coding","display_name":"Dirty paper coding","score":0.4727441072463989},{"id":"https://openalex.org/keywords/channel-access-method","display_name":"Channel access method","score":0.4664090871810913},{"id":"https://openalex.org/keywords/channel","display_name":"Channel (broadcasting)","score":0.4360588788986206},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.4276651442050934},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3870365023612976},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3586636185646057},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35407572984695435},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3523595631122589},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.344119668006897},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.29027700424194336},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.22569483518600464},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.18393677473068237},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.15376076102256775},{"id":"https://openalex.org/keywords/mimo","display_name":"MIMO","score":0.13248121738433838},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.08781439065933228}],"concepts":[{"id":"https://openalex.org/C117313154","wikidata":"https://www.wikidata.org/wiki/Q878344","display_name":"Time division multiple access","level":2,"score":0.9532251358032227},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.6307861804962158},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6131476759910583},{"id":"https://openalex.org/C101722063","wikidata":"https://www.wikidata.org/wiki/Q218825","display_name":"Random access","level":2,"score":0.5415123105049133},{"id":"https://openalex.org/C190519244","wikidata":"https://www.wikidata.org/wiki/Q901831","display_name":"Multi-frequency time division multiple access","level":5,"score":0.5105644464492798},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.49546968936920166},{"id":"https://openalex.org/C2780186295","wikidata":"https://www.wikidata.org/wiki/Q3305007","display_name":"Dirty paper coding","level":5,"score":0.4727441072463989},{"id":"https://openalex.org/C193430537","wikidata":"https://www.wikidata.org/wiki/Q1665191","display_name":"Channel access method","level":3,"score":0.4664090871810913},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.4360588788986206},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.4276651442050934},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3870365023612976},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3586636185646057},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35407572984695435},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3523595631122589},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.344119668006897},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.29027700424194336},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.22569483518600464},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.18393677473068237},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.15376076102256775},{"id":"https://openalex.org/C207987634","wikidata":"https://www.wikidata.org/wiki/Q176862","display_name":"MIMO","level":3,"score":0.13248121738433838},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.08781439065933228},{"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/C160562895","wikidata":"https://www.wikidata.org/wiki/Q7239557","display_name":"Precoding","level":4,"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/C130946814","wikidata":"https://www.wikidata.org/wiki/Q5988271","display_name":"MIMO-OFDM","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit.2014.6874836","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2014.6874836","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 IEEE International Symposium on Information Theory","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":13,"referenced_works":["https://openalex.org/W1607198972","https://openalex.org/W1810714366","https://openalex.org/W2016181222","https://openalex.org/W2031173376","https://openalex.org/W2044180609","https://openalex.org/W2046115679","https://openalex.org/W2099111195","https://openalex.org/W2100866683","https://openalex.org/W2104340231","https://openalex.org/W2106864314","https://openalex.org/W2524569595","https://openalex.org/W3140968660","https://openalex.org/W6638657921"],"related_works":["https://openalex.org/W1567375642","https://openalex.org/W1541664323","https://openalex.org/W2162587296","https://openalex.org/W115356109","https://openalex.org/W1991933460","https://openalex.org/W1945372791","https://openalex.org/W2998943502","https://openalex.org/W2153998550","https://openalex.org/W4243681997","https://openalex.org/W1969588416"],"abstract_inverted_index":{"Time":[0],"division":[1],"multiple":[2,29],"access":[3,30],"(TDMA)":[4],"is":[5,58,75,87],"widely":[6],"considered":[7],"to":[8,41,61],"be":[9],"a":[10,27,78,91],"practical":[11],"multi-access":[12],"communication":[13],"scheme":[14],"that":[15,34],"can":[16],"achieve":[17],"the":[18,48,53,62,69],"highest":[19],"possible":[20],"sum-rate":[21,67,74],"with":[22,82],"appropriate":[23],"power":[24],"allocation.":[25],"Exploring":[26],"Gaussian":[28,70],"channel,":[31],"we":[32],"show":[33],"this":[35],"result":[36],"does":[37],"not":[38],"carry":[39],"over":[40],"second-order":[42,66],"coding":[43,80],"rates.":[44],"In":[45],"particular,":[46],"as":[47],"number":[49],"of":[50,55],"users":[51],"grows,":[52],"cost":[54],"using":[56],"TDMA":[57],"significant":[59],"relative":[60],"largest":[63],"known":[64],"achievable":[65],"for":[68,96],"MAC.":[71],"The":[72],"latter":[73],"established":[76],"by":[77],"random":[79],"argument":[81],"non-i.i.d.":[83],"spherical":[84],"inputs,":[85],"which":[86],"conveniently":[88],"analyzed":[89],"via":[90],"central":[92],"limit":[93],"theorem":[94],"(CLT)":[95],"functions.":[97]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}