Silence-Based Communication
Communication complexity - the minimum amount of communication required - for computing a function of data held by several parties is studied. A communication model where silence is used to convey information is introduced. For this model the worst case and average-case complexities of symmetric fun...
Saved in:
Published in | IEEE transactions on information theory Vol. 56; no. 1; pp. 350 - 366 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
New York, NY
IEEE
01.01.2010
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Abstract | Communication complexity - the minimum amount of communication required - for computing a function of data held by several parties is studied. A communication model where silence is used to convey information is introduced. For this model the worst case and average-case complexities of symmetric functions are studied. For binary-input functions the average- and worst case complexities are determined and the protocols achieving them are described. For functions of nonbinary inputs one-round communication, where each party is restricted to communicate in consecutive stages, is considered and the extra amount of communication required by one- over multiple-round communication is analyzed. For the special case of ternary-input functions close lower and upper bounds on the worst case one-round complexity are provided and protocols achieving them are described. Protocols achieving the average-case one-round complexity for ternary-input functions are also described. These protocols can be generalized to inputs of arbitrary size. |
---|---|
AbstractList | Communication complexity--the minimum amount of communication required--for computing a function of data held by several parties is studied. A communication model where silence is used to convey information is introduced. For this model the worst case and average-case complexities of symmetric functions are studied. For binary-input functions the average- and worst case complexities are determined and the protocols achieving them are described. For functions of nonbinary inputs one-round communication, where each party is restricted to communicate in consecutive stages, is considered and the extra amount of communication required by one- over multiple-round communication is analyzed. For the special case of ternary-input functions close lower and upper bounds on the worst case one-round complexity are provided and protocols achieving them are described. Protocols achieving the average-case one-round complexity for ternary-input functions are also described. These protocols can be generalized to inputs of arbitrary size. Communication complexity-the minimum amount of communication required-for computing a function of data held by several parties is studied. A communication model where silence is used to convey information is introduced. For this model the worst case and average-case complexities of symmetric functions are studied. For binary-input functions the average- and worst case complexities are determined and the protocols achieving them are described. For functions of nonbinary inputs one-round communication, where each party is restricted to communicate in consecutive stages, is considered and the extra amount of communication required by one- over multiple-round communication is analyzed. For the special case of ternary-input functions close lower and upper bounds on the worst case one-round complexity are provided and protocols achieving them are described. Protocols achieving the average-case one-round complexity for ternary-input functions are also described. These protocols can be generalized to inputs of arbitrary size. [PUBLICATION ABSTRACT] |
Author | Dhulipala, A.K. Orlitsky, A. Fragouli, C. |
Author_xml | – sequence: 1 givenname: A.K. surname: Dhulipala fullname: Dhulipala, A.K. organization: Fraud Analytics Group, FICO, San Diego, CA, USA – sequence: 2 givenname: C. surname: Fragouli fullname: Fragouli, C. organization: Sch. of Comput. & Commun. Sci., EPFL, Lausanne, Switzerland – sequence: 3 givenname: A. surname: Orlitsky fullname: Orlitsky, A. organization: Dept. of Electr. & Comput. Eng., Univ. of California, La Jolla, CA, USA |
BackLink | http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=22493123$$DView record in Pascal Francis |
BookMark | eNqFkM1Lw0AQxRepYFu9C72IIJ5SZz-ze9TiR6HgwXpeNpsJpCSbmm0O_vdubenBi5cZhvnNG96bkFHoAhJyTWFOKZiH9XI9ZwAmFS405WdkTKXMM6OkGJExANWZEUJfkEmMmzQKSdmYzD7qBoPH7MlFLG8WXdsOofZuV3fhkpxXrol4dexT8vnyvF68Zav31-XicZV5wdQuM2WVe-0Uc6rQjkkttNZIvVFK-lJALpUvROUoU2AqhJIV4CVD1LxAlxs-JfcH3W3ffQ0Yd7ato8emcQG7IVqtqBQMBPxPUq05yxlP5O0fctMNfUg2LDXSJC0pEgQHyPddjD1WdtvXreu_LQW7T9WmVO0-VXtMNZ3cHXVd9K6pehd8HU93jAnD6e__2YGrEfG0ljxZAcV_AE1Wfpg |
CODEN | IETTAW |
CitedBy_id | crossref_primary_10_1016_j_comcom_2019_09_011 crossref_primary_10_53841_bpstcp_2019_15_1_56 crossref_primary_10_1109_JPROC_2010_2065790 crossref_primary_10_1016_j_tcs_2018_11_017 crossref_primary_10_1109_TCNS_2020_3030008 crossref_primary_10_1177_1046496417744883 crossref_primary_10_1109_TIT_2014_2365777 crossref_primary_10_1146_annurev_control_042820_010811 crossref_primary_10_1109_JSAC_2013_130403 crossref_primary_10_1109_TGCN_2021_3090044 crossref_primary_10_1145_2597633 crossref_primary_10_1080_09720529_2013_821361 |
Cites_doi | 10.1109/JSAC.2005.843543 10.1137/0406009 10.1109/WIOPT.2006.1666455 10.1016/S0019-9958(71)90155-0 10.1109/SFCS.1978.22 10.1109/18.57201 10.1145/321879.321883 10.1145/321592.321601 10.1109/7.18637 10.1109/IREPGIT.1954.6373407 10.1016/j.jda.2006.03.022 10.1002/0471200611 10.1145/800135.804414 10.1109/TIT.1961.1057615 10.1016/0890-5401(87)90037-X 10.1109/SFCS.1989.63514 10.1145/800061.808737 10.1007/BF01932395 10.1016/0022-0000(92)90047-M 10.1109/ISIT.2004.1365156 10.1017/CBO9780511574948 10.1006/inco.1994.1051 10.1016/j.jpdc.2004.04.002 |
ContentType | Journal Article |
Copyright | 2015 INIST-CNRS Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jan 2010 |
Copyright_xml | – notice: 2015 INIST-CNRS – notice: Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jan 2010 |
DBID | 97E RIA RIE IQODW AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 |
DOI | 10.1109/TIT.2009.2034813 |
DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005-present IEEE All-Society Periodicals Package (ASPP) 1998-Present IEEE Electronic Library (IEL) Pascal-Francis CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ANTE: Abstracts in New Technology & Engineering Engineering Research Database |
DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional Engineering Research Database ANTE: Abstracts in New Technology & Engineering |
DatabaseTitleList | Technology Research Database Technology Research Database Technology Research Database |
Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/ sourceTypes: Publisher |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Engineering Computer Science Applied Sciences |
EISSN | 1557-9654 |
EndPage | 366 |
ExternalDocumentID | 1935946711 10_1109_TIT_2009_2034813 22493123 5361506 |
Genre | orig-research Feature |
GroupedDBID | -~X .DC 0R~ 29I 3EH 4.4 5GY 5VS 6IK 97E AAJGR AASAJ AAYOK ABFSI ABQJQ ABVLG ACGFO ACGFS ACGOD ACIWK AENEX AETEA AETIX AI. AIBXA AKJIK ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD F5P HZ~ H~9 IAAWW IBMZZ ICLAB IDIHD IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P PQQKQ RIA RIE RIG RNS RXW TAE TN5 VH1 VJK XFK ABPTK IQODW AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 |
ID | FETCH-LOGICAL-c426t-9df7c8a62a6b8a2584888e1c9665cd40756cb4fa12609fe0d2b0c52ee83bea793 |
IEDL.DBID | RIE |
ISSN | 0018-9448 |
IngestDate | Thu Jul 25 10:19:39 EDT 2024 Fri Aug 16 07:34:29 EDT 2024 Fri Sep 13 05:45:57 EDT 2024 Thu Sep 26 16:54:03 EDT 2024 Sun Oct 22 16:06:54 EDT 2023 Wed Jun 26 19:26:39 EDT 2024 |
IsDoiOpenAccess | false |
IsOpenAccess | true |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 1 |
Keywords | one-round Lower bound symmetric functions Worst case method sensor networks Symmetric function Information transmission Upper bound Communication complexity function computation Sensor array multiple-round Signal detection |
Language | English |
License | CC BY 4.0 |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-c426t-9df7c8a62a6b8a2584888e1c9665cd40756cb4fa12609fe0d2b0c52ee83bea793 |
Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
OpenAccessLink | http://infoscience.epfl.ch/record/142314/files/dhulipala_itit.pdf |
PQID | 195940354 |
PQPubID | 23500 |
PageCount | 17 |
ParticipantIDs | proquest_journals_195940354 crossref_primary_10_1109_TIT_2009_2034813 ieee_primary_5361506 proquest_miscellaneous_818832723 pascalfrancis_primary_22493123 proquest_miscellaneous_861542040 |
PublicationCentury | 2000 |
PublicationDate | 2010-Jan. 2010 2010-01-00 20100101 |
PublicationDateYYYYMMDD | 2010-01-01 |
PublicationDate_xml | – month: 01 year: 2010 text: 2010-Jan. |
PublicationDecade | 2010 |
PublicationPlace | New York, NY |
PublicationPlace_xml | – name: New York, NY – name: New York |
PublicationTitle | IEEE transactions on information theory |
PublicationTitleAbbrev | TIT |
PublicationYear | 2010 |
Publisher | IEEE Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Publisher_xml | – name: IEEE – name: Institute of Electrical and Electronics Engineers – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
References | ref13 ref15 ref11 ref10 orlitsky (ref3) 1986 ref2 ref1 ref17 ref16 ref19 ref18 ref24 ref23 ref26 ref20 ref22 xu (ref14) 2004; 64 ref28 savari (ref27) 2004 ref7 ref9 ref4 ref6 ref5 karp (ref25) 1961; it 7 babai (ref12) 1995 graham (ref8) 1990 cot (ref21) 1974 |
References_xml | – ident: ref16 doi: 10.1109/JSAC.2005.843543 – ident: ref10 doi: 10.1137/0406009 – ident: ref17 doi: 10.1109/WIOPT.2006.1666455 – start-page: 460 year: 1974 ident: ref21 article-title: a linear-time ordering procedure with applications to variable length encoding publication-title: Proc 8th Princeton Conf Information Sciences and Systems contributor: fullname: cot – ident: ref24 doi: 10.1016/S0019-9958(71)90155-0 – ident: ref1 doi: 10.1109/SFCS.1978.22 – ident: ref26 doi: 10.1109/18.57201 – year: 1990 ident: ref8 publication-title: Ramsey Theory contributor: fullname: graham – ident: ref22 doi: 10.1145/321879.321883 – ident: ref23 doi: 10.1145/321592.321601 – ident: ref13 doi: 10.1109/7.18637 – ident: ref19 doi: 10.1109/IREPGIT.1954.6373407 – ident: ref18 doi: 10.1016/j.jda.2006.03.022 – ident: ref28 doi: 10.1002/0471200611 – start-page: 16 year: 1986 ident: ref3 publication-title: Complexity in Information Theory contributor: fullname: orlitsky – ident: ref2 doi: 10.1145/800135.804414 – volume: it 7 start-page: 27 year: 1961 ident: ref25 article-title: minimum-redundancy coding for the discrete noiseless channel publication-title: IRE Trans Inf Theory doi: 10.1109/TIT.1961.1057615 contributor: fullname: karp – start-page: 92 year: 2004 ident: ref27 article-title: bounds on the expected cost of one-to-one codes publication-title: Proc IEEE Int Symp Information Theory contributor: fullname: savari – ident: ref5 doi: 10.1016/0890-5401(87)90037-X – ident: ref6 doi: 10.1109/SFCS.1989.63514 – ident: ref9 doi: 10.1145/800061.808737 – ident: ref20 doi: 10.1007/BF01932395 – ident: ref7 doi: 10.1016/0022-0000(92)90047-M – year: 1995 ident: ref12 article-title: simultaneous messages vs. communication publication-title: Proc 12th Symp Theoretical Aspects of Computer Science contributor: fullname: babai – ident: ref15 doi: 10.1109/ISIT.2004.1365156 – ident: ref4 doi: 10.1017/CBO9780511574948 – ident: ref11 doi: 10.1006/inco.1994.1051 – volume: 64 start-page: 945 year: 2004 ident: ref14 article-title: distributed computing paradigms for collaborative signal and information processing in sensor networks publication-title: J Parallel Distrib Comput doi: 10.1016/j.jpdc.2004.04.002 contributor: fullname: xu |
SSID | ssj0014512 |
Score | 2.1119354 |
Snippet | Communication complexity - the minimum amount of communication required - for computing a function of data held by several parties is studied. A communication... Communication complexity-the minimum amount of communication required-for computing a function of data held by several parties is studied. A communication... Communication complexity--the minimum amount of communication required--for computing a function of data held by several parties is studied. A communication... |
SourceID | proquest crossref pascalfrancis ieee |
SourceType | Aggregation Database Index Database Publisher |
StartPage | 350 |
SubjectTerms | Analysis Applied sciences Communication channels Communication complexity Complexity Complexity theory Computation Computer networks Conveying Costs Detection, estimation, filtering, equalization, prediction DH-HEMTs Distributed computing Exact sciences and technology function computation Information theory Information, signal and communications theory Mathematical analysis Mathematical models multiple-round one-round Protocol Protocols Satellites sensor networks Signal and communications theory Signal, noise Silence symmetric functions Systems, networks and services of telecommunications Telecommunications Telecommunications and information theory Temperature sensors Transmission and modulation (techniques and equipments) Upper bound Upper bounds Very large scale integration |
Title | Silence-Based Communication |
URI | https://ieeexplore.ieee.org/document/5361506 https://www.proquest.com/docview/195940354/abstract/ https://search.proquest.com/docview/818832723 https://search.proquest.com/docview/861542040 |
Volume | 56 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LSwMxEB60Jz1YbRXXquzBi-C22Wyyj6OKokK9WKG3JclOQIRWbHvx1zvZF9YHeFtIWLIzmZlvdl4AZ4agUJgwFRhmdCAIkZIeTKOAC50otDqx1hU4jx_ju2fxMJXTDbhoa2EQsUw-w6F7LGP5xdys3K-ykYxc-_J4EzZTxqtarTZiIGRYdQYPSYDJ52hCkiwbTe4nVWNKzlzZabRmgsqZKi4jUi2IKLaaZvFDMZfW5rYL4-acVZLJ63C11EPz8a2F438_ZBd2atjpX1b3ZA82cNaDbjPSwa8lvAfbX_oT9mHw9FLWJAVXZOsKf62YZB-eb28m13dBPU0hMGSFl0FW2MSkKuYq1qniBDzI-cXQkL8jTUF-nYyNFlaF5OFkFlnBNTOSI6aRRkVifACd2XyGh-BnTGoUzA2jEkJaruNMcMU0xgWGAq0H5w2B87eqaUZeOhssy4kZbvRlltfM8KDv6NPuq0njwekaR9p1ghxZRObWg0HDorwWu0XuOuUIFknhgd-ukry4IIia4Xy1yAmgkBJL3Av-3EInEJy029HvZxvAVpVD4H7EHENn-b7CE4ImS31a3slPU63fKQ |
link.rule.ids | 315,786,790,802,4043,27956,27957,27958,55109 |
linkProvider | IEEE |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV3dT9swED-V8jD2MFg7tKwD8sDLpKU4jp3Uj2MCFUb7QpH6FtnOWUJI6bS2L_vrd86X1g0k3iLZipw731fu7ncA55ZcoThjOrLMmkiQR0p6cJJEXJhMozOZc77BeTZPpw_idimXPfja9cIgYlV8hmP_WOXyi5Xd-l9lFzLx8OXpHuyTnWeq7tbqcgZCxjU2eEwiTFFHm5Rk6mJxs6ihKTnzjafJjhGqpqr4mki9JrK4ep7Ff6q5sjfXhzBrT1qXmTyNtxsztr__AXF87accwbvG8Qy_1TflPfSwHMBhO9QhbGR8AG__Qigcwuj-sepKii7J2hXhTjvJB3i4vlp8n0bNPIXIkh3eRKpwmZ3olOvUTDQn14PCX4wtRTzSFhTZydQa4XRMMY5yyApumJUccZIY1CTIx9AvVyV-hFAxaVAwP45KCOm4SZXgmhlMC4wFugC-tATOf9awGXkVbjCVEzP88EuVN8wIYOjp0-1rSBPA6Q5HunVyOlRCBjeAUcuivBG8de6xcgRLpAgg7FZJYnwaRJe42q5zclFIjWX-BS9uoRMITvrt0_NnO4M308XsLr-7mf8YwUFdUeB_y3yG_ubXFk_IUdmY0-p-_gFEKOJ_ |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Silence-Based+Communication&rft.jtitle=IEEE+transactions+on+information+theory&rft.au=DHULIPALA%2C+Anand+K&rft.au=FRAGOULI%2C+Christina&rft.au=ORLITSKY%2C+Alon&rft.date=2010&rft.pub=Institute+of+Electrical+and+Electronics+Engineers&rft.issn=0018-9448&rft.eissn=1557-9654&rft.volume=56&rft.issue=1&rft.spage=350&rft.epage=366&rft_id=info:doi/10.1109%2FTIT.2009.2034813&rft.externalDBID=n%2Fa&rft.externalDocID=22493123 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9448&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9448&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9448&client=summon |