메뉴 건너뛰기




Volumn 56, Issue 9, 2010, Pages 4181-4206

Coordination capacity

Author keywords

Common randomness; cooperation capacity; coordination capacity; network dependence; rate distortion; source coding; strong Markov lemma; task assignment; Wyner common information

Indexed keywords

COMMON INFORMATION; COMMON RANDOMNESS; COOPERATION CAPACITY; COORDINATION CAPACITY; NETWORK DEPENDENCE; RATE DISTORTIONS; SOURCE-CODING; STRONG MARKOV LEMMA; TASK ASSIGNMENT;

EID: 77955754773     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2010.2054651     Document Type: Article
Times cited : (235)

References (35)
  • 2
    • 0022783899 scopus 로고
    • Distributed asynchronous deterministic and stochastic gradient optimization algorithms
    • Sep.
    • J. Tsitsiklis, D. Bertsekas, and M. Athans, "Distributed asynchronous deterministic and stochastic gradient optimization algorithms," IEEE Trans. Autom. Control, vol.31, no.9, pp. 803-812, Sep. 1986.
    • (1986) IEEE Trans. Autom. Control , vol.31 , Issue.9 , pp. 803-812
    • Tsitsiklis, J.1    Bertsekas, D.2    Athans, M.3
  • 3
    • 34250899886 scopus 로고    scopus 로고
    • Distributed average consensus with least-mean-square deviation
    • Jan.
    • L. Xiao, S. Boyd, and S.-J. Kim, "Distributed average consensus with least-mean-square deviation," J. Parallel Distrib. Comput., vol.67, no.1, pp. 33-46, Jan. 2007.
    • (2007) J. Parallel Distrib. Comput. , vol.67 , Issue.1 , pp. 33-46
    • Xiao, L.1    Boyd, S.2    Kim, S.-J.3
  • 5
    • 85039623622 scopus 로고
    • Some complexity questions related to distributive computing( preliminary report)
    • A. Yao, "Some complexity questions related to distributive computing( preliminary report)," in Proc. ACM Symp. Theory of Computing, 1979, pp. 209-213.
    • (1979) Proc. ACM Symp. Theory of Computing , pp. 209-213
    • Yao, A.1
  • 6
    • 0025208769 scopus 로고
    • Average and randomized communication complexity
    • Jan.
    • A. Orlitsky and A. El Gamal, "Average and randomized communication complexity," IEEE Trans. Inf. Theory, vol.36, no.1, pp. 3-16, Jan. 1990.
    • (1990) IEEE Trans. Inf. Theory , vol.36 , Issue.1 , pp. 3-16
    • Orlitsky, A.1    El Gamal, A.2
  • 9
    • 0016485894 scopus 로고
    • The common information of two dependent random variables
    • Mar.
    • A. Wyner, "The common information of two dependent random variables," IEEE Trans. Inf. Theory, vol.IT-21, no.2, pp. 163-179, Mar. 1975.
    • (1975) IEEE Trans. Inf. Theory , vol.IT-21 , Issue.2 , pp. 163-179
    • Wyner, A.1
  • 10
    • 34249036388 scopus 로고    scopus 로고
    • Common randomness and distributed control; A counterexample
    • V. Anantharam and V. Borkar, "Common randomness and distributed control; A counterexample," Syst. Control Lett., vol.56, pp. 568-572, 2007.
    • (2007) Syst. Control Lett. , vol.56 , pp. 568-572
    • Anantharam, V.1    Borkar, V.2
  • 12
    • 33847634245 scopus 로고    scopus 로고
    • Communicating probability distributions
    • Feb.
    • G. Kramer and S. Savari, "Communicating probability distributions," IEEE Trans. Inf. Theory, vol.53, no.2, pp. 518-525, Feb. 2007.
    • (2007) IEEE Trans. Inf. Theory , vol.53 , Issue.2 , pp. 518-525
    • Kramer, G.1    Savari, S.2
  • 13
    • 27744572437 scopus 로고    scopus 로고
    • The empirical distribution of rateconstrained source codes
    • Nov.
    • T. Weissman and E. Ordentlich, "The empirical distribution of rateconstrained source codes," IEEE Trans. Inf. Theory, vol.51, no.11, pp. 3718-3733, Nov. 2005.
    • (2005) IEEE Trans. Inf. Theory , vol.51 , Issue.11 , pp. 3718-3733
    • Weissman, T.1    Ordentlich, E.2
  • 14
    • 0027602480 scopus 로고
    • Approximation theory of output statistics
    • May
    • T. Han and S. Verdú, "Approximation theory of output statistics," IEEE Trans. Inf. Theory, vol.39, no.3, pp. 752-772, May 1993.
    • (1993) IEEE Trans. Inf. Theory , vol.39 , Issue.3 , pp. 752-772
    • Han, T.1    Verdú, S.2
  • 15
    • 0036795510 scopus 로고    scopus 로고
    • Entanglement-assisted capacity of a quantum channel and the reverse Shannon theorem
    • Oct.
    • C. Bennett, P. Shor, J. Smolin, and A. Thapliyal, "Entanglement- assisted capacity of a quantum channel and the reverse Shannon theorem," IEEE Trans. Inf. Theory, vol.48, no.10, pp. 2637-2655, Oct. 2002.
    • (2002) IEEE Trans. Inf. Theory , vol.48 , Issue.10 , pp. 2637-2655
    • Bennett, C.1    Shor, P.2    Smolin, J.3    Thapliyal, A.4
  • 16
    • 0003396318 scopus 로고
    • Coding theorems for a discrete source with fidelity criterion
    • R. E. Machol, Ed. New York: McGraw-Hill
    • C. Shannon, "Coding theorems for a discrete source with fidelity criterion," in Information and Decision Processes, R. E. Machol, Ed. New York: McGraw-Hill, 1960, pp. 93-126.
    • (1960) Information and Decision Processes , pp. 93-126
    • Shannon, C.1
  • 17
    • 0019566109 scopus 로고
    • Source coding theory for cascade and branching communication systems
    • May
    • H. Yamamoto, "Source coding theory for cascade and branching communication systems," IEEE Trans. Inf. Theory, vol.IT-27, no.3, pp. 299-308, May 1981.
    • (1981) IEEE Trans. Inf. Theory , vol.IT-27 , Issue.3 , pp. 299-308
    • Yamamoto, H.1
  • 18
    • 0020205374 scopus 로고
    • Rate-distortion for correlated sources with partially separated encoders
    • Nov.
    • A. Kaspi and T. Berger, "Rate-distortion for correlated sources with partially separated encoders," IEEE Trans. Inf. Theory, vol.IT-28, pp. 828-840, Nov. 1982.
    • (1982) IEEE Trans. Inf. Theory , vol.IT-28 , pp. 828-840
    • Kaspi, A.1    Berger, T.2
  • 20
    • 0030151522 scopus 로고    scopus 로고
    • Source coding theory for a triangular communication system
    • May
    • H. Yamamoto, "Source coding theory for a triangular communication system,"IEEETrans. Inf. Theory, vol.42, no.3, pp. 848-853,May1996.
    • (1996) IEEETrans. Inf. Theory , vol.42 , Issue.3 , pp. 848-853
    • Yamamoto, H.1
  • 21
    • 0019070330 scopus 로고
    • Source coding for multiple descriptions
    • Oct.
    • J. Wolf, A. Wyner, and J. Ziv, "Source coding for multiple descriptions," Bell Syst. Tech. J., vol.59, pp. 1417-1426, Oct. 1980.
    • (1980) Bell Syst. Tech. J. , vol.59 , pp. 1417-1426
    • Wolf, J.1    Wyner, A.2    Ziv, J.3
  • 22
    • 0023386644 scopus 로고
    • New results in binary multiple descriptions
    • Jul.
    • Z. Zhang and T. Berger, "New results in binary multiple descriptions," IEEE Trans. Inf. Theory, vol.IT-33, pp. 502-521, Jul. 1987.
    • (1987) IEEE Trans. Inf. Theory , vol.IT-33 , pp. 502-521
    • Zhang, Z.1    Berger, T.2
  • 23
    • 0003307426 scopus 로고
    • Multiterminal source coding
    • G. Longo, Ed. New York: Springer-Verlag, CISM Course and Lecture
    • T. Berger, "Multiterminal source coding," in Information Theory Approach to Communications, G. Longo, Ed. New York: Springer-Verlag, 1978, CISM Course and Lecture, pp. 171-231.
    • (1978) Information Theory Approach to Communications , pp. 171-231
    • Berger, T.1
  • 25
    • 65749106954 scopus 로고    scopus 로고
    • On multi-resolution coding and a two-hop network
    • presented at
    • W. Gu and M. Effros, "On multi-resolution coding and a two-hop network," presented at the Data Compression Conf., 2006.
    • (2006) The Data Compression Conf.
    • Gu, W.1    Effros, M.2
  • 26
    • 51649130693 scopus 로고    scopus 로고
    • On network coding of independent and dependent sources in line networks
    • presented at the Nice, France
    • M. Bakshi, M. Effros, W. Gu, and R. Koetter, "On network coding of independent and dependent sources in line networks," presented at the IEEE Int. Symp. Information Theory, Nice, France, 2007.
    • (2007) IEEE Int. Symp. Information Theory
    • Bakshi, M.1    Effros, M.2    Gu, W.3    Koetter, R.4
  • 27
    • 0016882596 scopus 로고
    • The rate-distortion function for source coding with side information at the decoder
    • Jan.
    • A. Wyner and J. Ziv, "The rate-distortion function for source coding with side information at the decoder," IEEE Trans. Inf. Theory, vol.22, no.1, pp. 1-10, Jan. 1976.
    • (1976) IEEE Trans. Inf. Theory , vol.22 , Issue.1 , pp. 1-10
    • Wyner, A.1    Ziv, J.2
  • 29
    • 0035271234 scopus 로고    scopus 로고
    • Coding for computing
    • Mar.
    • A. Orlitsky and J. Roche, "Coding for computing," IEEE Trans. Inf. Theory, vol.47, no.3, pp. 903-917, Mar. 2001.
    • (2001) IEEE Trans. Inf. Theory , vol.47 , Issue.3 , pp. 903-917
    • Orlitsky, A.1    Roche, J.2
  • 30
    • 52349098116 scopus 로고    scopus 로고
    • Communication requirements for generating correlated random variables
    • Toronto, ON, Canada
    • P. Cuff, "Communication requirements for generating correlated random variables," in Proc. IEEE Int. Symp. Information Theory, Toronto, ON, Canada, 2008, pp. 1393-1397.
    • (2008) Proc. IEEE Int. Symp. Information Theory , pp. 1393-1397
    • Cuff, P.1
  • 31
    • 0029734858 scopus 로고    scopus 로고
    • Simulation of random processes and ratedistortion theory
    • Jan.
    • Y. Steinberg and S. Verdú, "Simulation of random processes and ratedistortion theory," IEEE Trans. Inf. Theory, vol.42, no.1, pp. 63-86, Jan. 1996.
    • (1996) IEEE Trans. Inf. Theory , vol.42 , Issue.1 , pp. 63-86
    • Steinberg, Y.1    Verdú, S.2
  • 34
    • 0016510308 scopus 로고
    • On source coding with side-information at the decoder
    • May
    • A. Wyner, "On source coding with side-information at the decoder," IEEE Trans. Inf. Theory, vol.21, no.3, pp. 294-300, May 1975.
    • (1975) IEEE Trans. Inf. Theory , vol.21 , Issue.3 , pp. 294-300
    • Wyner, A.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.