{"id":"https://openalex.org/W2125675324","doi":"https://doi.org/10.1109/isit.2004.1365399","title":"Communication and distributional complexity of joint probability mass functions","display_name":"Communication and distributional complexity of joint probability mass functions","publication_year":2004,"publication_date":"2004-12-23","ids":{"openalex":"https://openalex.org/W2125675324","doi":"https://doi.org/10.1109/isit.2004.1365399","mag":"2125675324"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2004.1365399","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365399","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","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/A5108615688","display_name":"Sidharth Jaggi","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":true,"raw_author_name":"S. Jaggi","raw_affiliation_strings":["Department of Electrical Engineering, California Institute of Technology, Pasadena, CA, USA","Dept. of Electr. Eng., Caltech, Pasadena, CA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, California Institute of Technology, Pasadena, CA, USA","institution_ids":["https://openalex.org/I122411786"]},{"raw_affiliation_string":"Dept. of Electr. Eng., Caltech, Pasadena, CA","institution_ids":["https://openalex.org/I122411786"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001054791","display_name":"Michelle Effros","orcid":"https://orcid.org/0000-0003-3757-0675"},"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":"M. Effros","raw_affiliation_strings":["Department of Electrical Engineering, California Institute of Technology, Pasadena, CA, USA","Dept. of Electr. Eng., Caltech, Pasadena, CA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, California Institute of Technology, Pasadena, CA, USA","institution_ids":["https://openalex.org/I122411786"]},{"raw_affiliation_string":"Dept. of Electr. Eng., Caltech, Pasadena, CA","institution_ids":["https://openalex.org/I122411786"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5108615688"],"corresponding_institution_ids":["https://openalex.org/I122411786"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.16833681,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"362","last_page":"362"},"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9994000196456909,"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.9991000294685364,"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/joint-probability-distribution","display_name":"Joint probability distribution","score":0.5899742841720581},{"id":"https://openalex.org/keywords/random-variable","display_name":"Random variable","score":0.5680477619171143},{"id":"https://openalex.org/keywords/lossless-compression","display_name":"Lossless compression","score":0.5438980460166931},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.528576672077179},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5098885297775269},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4367797076702118},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.434467613697052},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.432994544506073},{"id":"https://openalex.org/keywords/zero","display_name":"Zero (linguistics)","score":0.4207841455936432},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.40443143248558044},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39636749029159546},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37375038862228394},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.26774537563323975},{"id":"https://openalex.org/keywords/data-compression","display_name":"Data compression","score":0.12857234477996826}],"concepts":[{"id":"https://openalex.org/C18653775","wikidata":"https://www.wikidata.org/wiki/Q1333358","display_name":"Joint probability distribution","level":2,"score":0.5899742841720581},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.5680477619171143},{"id":"https://openalex.org/C81081738","wikidata":"https://www.wikidata.org/wiki/Q55542","display_name":"Lossless compression","level":3,"score":0.5438980460166931},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.528576672077179},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5098885297775269},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4367797076702118},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.434467613697052},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.432994544506073},{"id":"https://openalex.org/C2780813799","wikidata":"https://www.wikidata.org/wiki/Q3274237","display_name":"Zero (linguistics)","level":2,"score":0.4207841455936432},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.40443143248558044},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39636749029159546},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37375038862228394},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.26774537563323975},{"id":"https://openalex.org/C78548338","wikidata":"https://www.wikidata.org/wiki/Q2493","display_name":"Data compression","level":2,"score":0.12857234477996826},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1109/isit.2004.1365399","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2004.1365399","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:authors.library.caltech.edu:7435","is_oa":false,"landing_page_url":"https://resolver.caltech.edu/CaltechAUTHORS:JAGisit04","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.701.7155","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.701.7155","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://personal.ie.cuhk.edu.hk/%7Esjaggi/files/comm_comp.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.923.5138","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.923.5138","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/7435/1/JAGisit04.pdf","raw_type":"text"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire_cris_publications/b666ad5d-558e-4628-a9f7-dec20df9e92e","is_oa":false,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/b666ad5d-558e-4628-a9f7-dec20df9e92e","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Jaggi, S & Effros, M 2004, Communication and distributional complexity of joint probability mass functions. in International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.. pp. 362-362.","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:research-information.bris.ac.uk:publications/b666ad5d-558e-4628-a9f7-dec20df9e92e","is_oa":false,"landing_page_url":"https://hdl.handle.net/1983/b666ad5d-558e-4628-a9f7-dec20df9e92e","pdf_url":null,"source":{"id":"https://openalex.org/S4306400895","display_name":"Bristol Research (University of Bristol)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I36234482","host_organization_name":"University of Bristol","host_organization_lineage":["https://openalex.org/I36234482"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Jaggi, S & Effros, M 2004, Communication and distributional complexity of joint probability mass functions. in International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings.. pp. 362-362.","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W1573715174","https://openalex.org/W2071801393","https://openalex.org/W2340787257","https://openalex.org/W4210551624"],"related_works":["https://openalex.org/W2526245987","https://openalex.org/W4378551395","https://openalex.org/W779566600","https://openalex.org/W4308064958","https://openalex.org/W3217767640","https://openalex.org/W4226056425","https://openalex.org/W173377860","https://openalex.org/W4230526720","https://openalex.org/W1607663644","https://openalex.org/W4288088475"],"abstract_inverted_index":{"The":[0],"problem":[1,117],"of":[2,14,18,25,28,47,56,59,68,78,86,94,110,118],"truly-lossless":[3],"(P":[4],"<sub":[5,53,88],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[6,54,89],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">e</sub>":[7],"=0)":[8],"distributed":[9,45],"source":[10],"coding":[11],"requires":[12,140],"knowledge":[13],"the":[15,19,23,26,29,44,48,102,108,111,116,121,148],"joint":[16,50],"statistics":[17],"sources.":[20],"In":[21],"particular":[22,129],"locations":[24],"zeroes":[27],"probability":[30],"mass":[31],"functions":[32],"(pmfs)":[33],"are":[34],"crucial":[35],"for":[36],"encoding":[37],"at":[38,64],"rates":[39],"below":[40],"(H(X),H(Y)).":[41],"We":[42,71,96],"consider":[43,72,115],"computation":[46],"empirical":[49,122],"pmf":[51,123],"P":[52,87],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">n</sub>":[55,90],"a":[57,69,92,125,128,141],"sequence":[58],"random":[60],"variable":[61],"pairs":[62],"observed":[63],"physically":[65],"separated":[66],"nodes":[67],"network.":[70],"both":[73,83],"worst-case":[74],"and":[75,81,91,131],"average":[76],"measures":[77],"information":[79],"exchange":[80],"treat":[82],"exact":[84],"calculation":[85],"notion":[93],"approximation.":[95],"find":[97],"that":[98,133,144],"in":[99,127,134,147],"all":[100],"cases":[101,136],"communication":[103,142],"cost":[104,143],"grows":[105],"linearly":[106],"with":[107],"size":[109,150],"input.":[112],"Further,":[113],"we":[114],"determining":[119],"whether":[120],"has":[124],"zero":[126],"location":[130],"show":[132],"most":[135],"considered":[137],"this":[138],"also":[139],"is":[145],"linear":[146],"input":[149]},"counts_by_year":[],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}
