메뉴 건너뛰기




Volumn , Issue , 2009, Pages 1506-1510

Feedback communication over individual channels

Author keywords

[No Author keywords available]

Indexed keywords

ACHIEVABLE RATE; ADAPTIVE SCHEME; CHANNEL BEHAVIOR; CHANNEL INPUTS; FEEDBACK COMMUNICATIONS; POSTERIORI; PRIOR KNOWLEDGE;

EID: 70449492959     PISSN: 21578102     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2009.5205853     Document Type: Conference Paper
Times cited : (6)

References (11)
  • 1
    • 33749434094 scopus 로고    scopus 로고
    • Communicating using Feedback over a Binary Channel with Arbitrary Noise Sequence
    • Adelaide, Australia, September
    • O. Shayevitz and M. Feder, "Communicating using Feedback over a Binary Channel with Arbitrary Noise Sequence", International Symposium on Information Theory (ISIT), Adelaide, Australia, September 2005.
    • (2005) International Symposium on Information Theory (ISIT)
    • Shayevitz, O.1    Feder, M.2
  • 3
    • 84888077474 scopus 로고    scopus 로고
    • Krishnan Eswaran, Anand D. Sarwate, Anant Sahai, and Michael Gastpar, Limited feedback achieves the empirical capacity, Department of Electrical Engineering and Computer Sciences, University of California, arXiv:0711.0237vl [cs.IT] 2 Nov 2007.
    • Krishnan Eswaran, Anand D. Sarwate, Anant Sahai, and Michael Gastpar, "Limited feedback achieves the empirical capacity," Department of Electrical Engineering and Computer Sciences, University of California, arXiv:0711.0237vl [cs.IT] 2 Nov 2007.
  • 5
    • 70449493142 scopus 로고    scopus 로고
    • Communication over Individual Channels
    • arXiv:0901.1473vl [cs.IT, 11 Jan
    • Yuval Lomnitz and Meir Feder, "Communication over Individual Channels," arXiv:0901.1473vl [cs.IT], 11 Jan 2009, http://arxiv.org/abs/ 0901.1473v1
    • (2009)
    • Lomnitz, Y.1    Feder, M.2
  • 6
    • 0016660286 scopus 로고
    • Nonprobabilistic mutual information without memory
    • V. D. Goppa, Nonprobabilistic mutual information without memory, Probl. Contr. Inform. Theory, vol. 4, pp. 97-102, 1975
    • (1975) Probl. Contr. Inform. Theory , vol.4 , pp. 97-102
    • Goppa, V.D.1
  • 7
    • 0032182921 scopus 로고    scopus 로고
    • Reliable communication under channel uncertainty
    • Oct
    • A. Lapidoth and P. Narayan, "Reliable communication under channel uncertainty," Information Theory, IEEE Transactions on , vol.44, no.6, pp.2148-2177, Oct 1998
    • (1998) Information Theory, IEEE Transactions on , vol.44 , Issue.6 , pp. 2148-2177
    • Lapidoth, A.1    Narayan, P.2
  • 8
    • 0023984409 scopus 로고
    • The Capacity ofthe Arbitrarily Varying Channel Revisited : Positivity, Constraints
    • March
    • I. Csiszar and P. Narayan, "The Capacity ofthe Arbitrarily Varying Channel Revisited : Positivity, Constraints", IEEE Transactions On Information Theory, Vol. 34, No.2, March 1988
    • (1988) IEEE Transactions On Information Theory , vol.34 , Issue.2
    • Csiszar, I.1    Narayan, P.2
  • 9
    • 5044248629 scopus 로고    scopus 로고
    • Communication over an Unknown Channel via Common Broadcasting,
    • Ph.D. dissertation, Tel Aviv University
    • Nadav Shulman, "Communication over an Unknown Channel via Common Broadcasting," Ph.D. dissertation, Tel Aviv University, 2003
    • (2003)
    • Shulman, N.1
  • 11
    • 84888075298 scopus 로고    scopus 로고
    • Mukul Agarwal, Anant Sahai, Sanjoy Mitter, Coding into a source: a direct inverse Rate-Distortion theorem, arXiv:cs/0610142vl [cs.IT] (presented at Allerton 06)
    • Mukul Agarwal, Anant Sahai, Sanjoy Mitter, "Coding into a source: a direct inverse Rate-Distortion theorem," arXiv:cs/0610142vl [cs.IT] (presented at Allerton 06)


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