{"id":"https://openalex.org/W2963245651","doi":"https://doi.org/10.1109/isit.2017.8006844","title":"On the sub-optimality of single-letter coding in multi-terminal communications","display_name":"On the sub-optimality of single-letter coding in multi-terminal communications","publication_year":2017,"publication_date":"2017-06-01","ids":{"openalex":"https://openalex.org/W2963245651","doi":"https://doi.org/10.1109/isit.2017.8006844","mag":"2963245651"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2017.8006844","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006844","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 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/A5008196853","display_name":"Farhad Shirani","orcid":"https://orcid.org/0000-0003-1316-3899"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Farhad Shirani Chaharsooghi","raw_affiliation_strings":["Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, Michigan"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, Michigan","institution_ids":["https://openalex.org/I27837315"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012221966","display_name":"S. Sandeep Pradhan","orcid":"https://orcid.org/0000-0001-8406-4404"},"institutions":[{"id":"https://openalex.org/I27837315","display_name":"University of Michigan","ror":"https://ror.org/00jmfr291","country_code":"US","type":"education","lineage":["https://openalex.org/I27837315"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Sandeep Pradhan","raw_affiliation_strings":["Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, Michigan"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, Michigan","institution_ids":["https://openalex.org/I27837315"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5008196853"],"corresponding_institution_ids":["https://openalex.org/I27837315"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.24295945,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"2","issue":null,"first_page":"1823","last_page":"1827"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10964","display_name":"Wireless Communication Security Techniques","score":0.9997000098228455,"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.9997000098228455,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9990000128746033,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6350613236427307},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.6019948720932007},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5270887613296509},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5249885320663452},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.45806294679641724},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3967321813106537},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37664687633514404},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.34782522916793823},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.2217709720134735},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.189986914396286},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.1462155282497406}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6350613236427307},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.6019948720932007},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5270887613296509},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5249885320663452},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.45806294679641724},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3967321813106537},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37664687633514404},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34782522916793823},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.2217709720134735},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.189986914396286},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1462155282497406},{"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/isit.2017.8006844","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2017.8006844","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1936256935","https://openalex.org/W1990531224","https://openalex.org/W1995875735","https://openalex.org/W2042815407","https://openalex.org/W2084998208","https://openalex.org/W2105706181","https://openalex.org/W2106864314","https://openalex.org/W2123224102","https://openalex.org/W2144970857","https://openalex.org/W2170862660","https://openalex.org/W2962764776","https://openalex.org/W3216977419","https://openalex.org/W6734367355"],"related_works":["https://openalex.org/W2372403409","https://openalex.org/W4242726756","https://openalex.org/W2938514635","https://openalex.org/W144832045","https://openalex.org/W4360764540","https://openalex.org/W1979328687","https://openalex.org/W4231657010","https://openalex.org/W2132049714","https://openalex.org/W2007917622","https://openalex.org/W1993278628"],"abstract_inverted_index":{"We":[0,15,26,36],"investigate":[1],"binary":[2],"block-codes":[3],"(BBC).":[4],"A":[5],"BBC":[6],"is":[7,54],"defined":[8],"as":[9],"a":[10],"vector":[11,29,39],"of":[12,30,33,47],"Boolean":[13],"functions.":[14],"consider":[16],"BBCs":[17],"which":[18],"are":[19,68],"generated":[20],"randomly,":[21],"and":[22],"using":[23],"single-letter":[24,62],"distributions.":[25],"characterize":[27],"the":[28,42,45,52,59,66],"dependency":[31],"spectrums":[32],"these":[34],"BBCs.":[35,50],"use":[37],"this":[38],"to":[40,56],"upper-bound":[41,53],"correlation":[43],"between":[44],"outputs":[46],"two":[48],"distributed":[49],"Finally,":[51],"used":[55],"show":[57],"that":[58],"large":[60],"blocklength":[61],"coding":[63],"schemes":[64],"in":[65,70],"literature":[67],"sub-optimal":[69],"some":[71],"multiterminal":[72],"communication":[73],"settings.":[74]},"counts_by_year":[{"year":2021,"cited_by_count":1}],"updated_date":"2026-04-17T18:11:37.981687","created_date":"2025-10-10T00:00:00"}