메뉴 건너뛰기




Volumn , Issue , 2012, Pages 565-571

Strong coordination with polar codes

Author keywords

[No Author keywords available]

Indexed keywords

BINARY SYMMETRIC CHANNEL; CAPACITY REGIONS; DISCRETE MEMORYLESS CHANNELS; POLAR CODES; TWO-NODE NETWORK;

EID: 84875715192     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/Allerton.2012.6483268     Document Type: Conference Paper
Times cited : (30)

References (11)
  • 2
    • 67650099990 scopus 로고    scopus 로고
    • Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels
    • E. Arikan, "Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels," IEEE Transactions on Information Theory, vol. 55, no. 7, pp. 3051-3073, 2009.
    • (2009) IEEE Transactions on Information Theory , vol.55 , Issue.7 , pp. 3051-3073
    • Arikan, E.1
  • 4
    • 77950200691 scopus 로고    scopus 로고
    • Polar codes are optimal for lossy source coding
    • April
    • S. B. Korada and R. L. Urbanke, "Polar Codes are Optimal for Lossy Source Coding," IEEE Transactions on Information Theory, vol. 56, no. 4, pp. 1751-1768, April 2010.
    • (2010) IEEE Transactions on Information Theory , vol.56 , Issue.4 , pp. 1751-1768
    • Korada, S.B.1    Urbanke, R.L.2
  • 5
    • 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
  • 6
    • 0016485894 scopus 로고
    • The common information of two dependent random variables
    • March
    • A. Wyner, "The Common Information of Two Dependent Random Variables," IEEE Trans. Inf. Theory, vol. 21, no. 2, pp. 163-179, March 1975.
    • (1975) IEEE Trans. Inf. Theory , vol.21 , Issue.2 , pp. 163-179
    • Wyner, A.1
  • 7
    • 33645727315 scopus 로고    scopus 로고
    • General nonasymptotic and asymptotic formulas in channel resolvability and identification capacity and their application to the wiretap channels
    • April
    • M. Hayashi, "General Nonasymptotic and Asymptotic Formulas in Channel Resolvability and Identification Capacity and their Application to the Wiretap Channels," IEEE Trans. Inf. Theory, vol. 52, no. 4, pp. 1562-1575, April 2006.
    • (2006) IEEE Trans. Inf. Theory , vol.52 , Issue.4 , pp. 1562-1575
    • Hayashi, M.1
  • 8
    • 80054802506 scopus 로고    scopus 로고
    • Achieving secrecy: Capacity vs. resolvability
    • Saint Petersburg, Russia, August
    • M. R. Bloch, "Achieving Secrecy: Capacity vs. Resolvability," in Proc. of IEEE International Symposium on Information Theory, Saint Petersburg, Russia, August 2011, pp. 632-636.
    • (2011) Proc. of IEEE International Symposium on Information Theory , pp. 632-636
    • Bloch, M.R.1
  • 9
    • 80053941690 scopus 로고    scopus 로고
    • Achieving the secrecy capacity of wiretap channels using polar codes
    • H. Mahdavifar and A. Vardy, "Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes," IEEE. Trans. Inf. Theory, vol. 57, no. 10, pp. 6428-6443, 2011.
    • (2011) IEEE Trans. Inf. Theory , vol.57 , Issue.10 , pp. 6428-6443
    • Mahdavifar, H.1    Vardy, A.2


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