메뉴 건너뛰기




Volumn , Issue , 2009, Pages 1510-1517

Infinite-message distributed source coding for two-terminal interactive computing

Author keywords

[No Author keywords available]

Indexed keywords

BERNOULLI; BLOCK SOURCE CODING; COMPUTATION PROBLEMS; DISTRIBUTED SOURCE CODING; FIXED NUMBERS; FUNCTIONALS; GEOMETRIC APPROACHES; INTERACTIVE COMPUTING; INTERACTIVE FUNCTIONS; ITERATIVE ALGORITHM; JOINT SOURCE; SUM-RATE;

EID: 77949628327     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ALLERTON.2009.5394497     Document Type: Conference Paper
Times cited : (12)

References (10)
  • 1
    • 52349124411 scopus 로고    scopus 로고
    • Two-terminal distributed source coding with alternating messages for function computation
    • Toronto, Canada, Jul. 6-11
    • N. Ma and P. Ishwar, "Two-terminal distributed source coding with alternating messages for function computation," in Proc. IEEE Int. Symp. Inform. Theory, Toronto, Canada, Jul. 6-11 2008, pp. 51-55.
    • (2008) Proc. IEEE Int. Symp. Inform. Theory , pp. 51-55
    • Ma, N.1    Ishwar, P.2
  • 2
    • 77949588091 scopus 로고    scopus 로고
    • Distributed source coding for interactive function computation
    • arXiv:0801.0756v4 [cs.IT, Nov
    • N. Ma and P. Ishwar, "Distributed source coding for interactive function computation," arXiv:0801.0756v4 [cs.IT], Nov. 2008.
    • (2008)
    • Ma, N.1    Ishwar, P.2
  • 3
    • 85039623622 scopus 로고
    • Some complexity questions related to distributed computing
    • Atlanta, GA, Apr. 30, May 2
    • A. C. Yao, "Some complexity questions related to distributed computing," in Proc.11th ACM Symp.Theory of Computing (STOC), Atlanta, GA, Apr. 30 - May 2 1979, pp. 209-213.
    • (1979) Proc.11th ACM Symp.Theory of Computing (STOC) , pp. 209-213
    • Yao, A.C.1
  • 5
    • 0025486359 scopus 로고
    • Worst-case interactive communication I: Two messages are almost optimal
    • Sep
    • A. Orlitsky, "Worst-case interactive communication I: two messages are almost optimal," IEEE Trans. Inf. Theory, vol. 36, no. 5, pp. 1111-1126, Sep. 1990.
    • (1990) IEEE Trans. Inf. Theory , vol.36 , Issue.5 , pp. 1111-1126
    • Orlitsky, A.1
  • 6
    • 0026189278 scopus 로고
    • Worst-case interactive communication II: Two messages are not optimal
    • Jul
    • -, "Worst-case interactive communication II: two messages are not optimal," IEEE Trans. Inf. Theory, vol. 37, no. 4, pp. 995-1005, Jul. 1991.
    • (1991) IEEE Trans. Inf. Theory , vol.37 , Issue.4 , pp. 995-1005
    • Orlitsky, A.1
  • 7
    • 0022149454 scopus 로고
    • Two-way source coding with a fidelity criterion
    • Nov
    • A. H. Kaspi, "Two-way source coding with a fidelity criterion," IEEE Trans. Inf. Theory, vol. IT-31, no. 6, pp. 735-740, Nov. 1985.
    • (1985) IEEE Trans. Inf. Theory , vol.IT-31 , Issue.6 , pp. 735-740
    • Kaspi, A.H.1
  • 8
    • 0035271234 scopus 로고    scopus 로고
    • Coding for computing
    • Mar
    • A. Orlitsky and J. R. Roche, "Coding for computing," IEEE Trans. Inf. Theory, vol. IT-47, no. 3, pp. 903-917, Mar. 2001.
    • (2001) IEEE Trans. Inf. Theory , vol.IT-47 , Issue.3 , pp. 903-917
    • Orlitsky, A.1    Roche, J.R.2
  • 9
    • 77949634685 scopus 로고    scopus 로고
    • Infinite-message distributed source coding for two-terminal interactive computing
    • arXiv:0908.3512v2 [cs.IT, Oct
    • N. Ma and P. Ishwar, "Infinite-message distributed source coding for two-terminal interactive computing," arXiv:0908.3512v2 [cs.IT], Oct. 2009.
    • (2009)
    • Ma, N.1    Ishwar, P.2
  • 10
    • 0004267646 scopus 로고
    • Princeton: Princeton University Press
    • R. T. Rockafellar, Convex Analysis. Princeton: Princeton University Press, 1970.
    • (1970) Convex Analysis
    • Rockafellar, R.T.1


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