메뉴 건너뛰기




Volumn , Issue , 2013, Pages 1127-1131

Polar codes for broadcast channels

Author keywords

Cover's superposition codes; Deterministic broadcast channel; Marton's construction; Polar codes

Indexed keywords

AVERAGE PROBABILITY OF ERROR; BROADCAST CHANNELS; BROADCAST RECEIVERS; BROADCAST STRATEGY; ENCODING AND DECODING; POLAR CODES; POLARIZATION INDICES; SUPERPOSITION CODES;

EID: 84890324319     PISSN: 21578095     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2013.6620402     Document Type: Conference Paper
Times cited : (16)

References (23)
  • 3
    • 0018467629 scopus 로고
    • A coding theorem for the discrete memoryless broadcast channel
    • May
    • K. Marton, "A coding theorem for the discrete memoryless broadcast channel," IEEE Trans. on Inform. Theory, vol. 25, pp. 306-311, May 1979.
    • (1979) IEEE Trans. on Inform. Theory , vol.25 , pp. 306-311
    • Marton, K.1
  • 4
    • 33846037665 scopus 로고    scopus 로고
    • An outer bound to the capacity region of the broadcast channel
    • Jan
    • C. Nair and A. E. Gamal, "An outer bound to the capacity region of the broadcast channel," IEEE Trans. on Inform. Theory, vol. 53, pp. 350-355, Jan. 2007.
    • (2007) IEEE Trans. on Inform. Theory , vol.53 , pp. 350-355
    • Nair, C.1    Gamal, A.E.2
  • 5
    • 0032184236 scopus 로고    scopus 로고
    • Comments on broadcast channels
    • Oct
    • T. M. Cover, "Comments on broadcast channels," IEEE Trans. on Inform. Theory, vol. 44, pp. 2524-2530, Oct. 1998.
    • (1998) IEEE Trans. on Inform. Theory , vol.44 , pp. 2524-2530
    • Cover, T.M.1
  • 6
    • 67650099990 scopus 로고    scopus 로고
    • Channel polarization: A method for constructing capacityachieving codes for symmetric binary-input memoryless channels
    • July
    • E. Arikan, "Channel polarization: A method for constructing capacityachieving codes for symmetric binary-input memoryless channels," IEEE Trans. on Inform. Theory, vol. 55, pp. 3051-3073, July 2009.
    • (2009) IEEE Trans. on Inform. Theory , vol.55 , pp. 3051-3073
    • Arikan, E.1
  • 8
    • 77954820589 scopus 로고    scopus 로고
    • Polar codes for the two-user binaryinput multiple-access channel
    • (Cairo, Egypt), Jan
    • E. Sasoglu E. Yeh, and E. Telatar, "Polar codes for the two-user binaryinput multiple-access channel," in Proc. IEEE Inform. Theory Workshop, (Cairo, Egypt), Jan. 2010.
    • (2010) Proc. IEEE Inform. Theory Workshop
    • Sasoglu, E.1    Yeh, E.2    Telatar, E.3
  • 9
    • 84863887401 scopus 로고    scopus 로고
    • Polar codes for the m-user multiple access channel
    • Aug
    • E. Abbe and E. Telatar, "Polar codes for the m-user multiple access channel," IEEE Trans. on Inform. Theory, vol. 58, pp. 5437-5448, Aug. 2012.
    • (2012) IEEE Trans. on Inform. Theory , vol.58 , pp. 5437-5448
    • Abbe, E.1    Telatar, E.2
  • 11
    • 80053941690 scopus 로고    scopus 로고
    • Achieving the secrecy capacity of wiretap channels using polar codes
    • Oct
    • H. Mahdavifar and A. Vardy, "Achieving the secrecy capacity of wiretap channels using polar codes," IEEE Trans. on Inform. Theory, vol. 57, pp. 6428-6443, Oct. 2011.
    • (2011) IEEE Trans. on Inform. Theory , vol.57 , pp. 6428-6443
    • Mahdavifar, H.1    Vardy, A.2
  • 15
    • 77950200691 scopus 로고    scopus 로고
    • Polar codes are optimal for lossy source coding
    • S. B. Korada and R. L. Urbanke, "Polar codes are optimal for lossy source coding," IEEE Trans. on Inform. Theory, vol. 56, no. 4, pp. 1751-1768, 2010.
    • (2010) IEEE Trans. on Inform. Theory , vol.56 , Issue.4 , pp. 1751-1768
    • Korada, S.B.1    Urbanke, R.L.2
  • 17
    • 84867518690 scopus 로고    scopus 로고
    • Polar coding for the slepian-wolf problem based on monotone chain rules
    • July
    • E. Arikan, "Polar coding for the slepian-wolf problem based on monotone chain rules," in Proc. of the IEEE Intern. Symp. on Inform. Theory, July 2012.
    • (2012) Proc. of the IEEE Intern. Symp. on Inform. Theory
    • Arikan, E.1
  • 18
    • 78649340775 scopus 로고    scopus 로고
    • Polar codes: Characterization of exponent, bounds, and constructions
    • Dec
    • S. Korada, E. Sasoglu and R. Urbanke, "Polar codes: Characterization of exponent, bounds, and constructions," IEEE Trans. on Inform. Theory, vol. 56, pp. 6253-6264, Dec. 2010.
    • (2010) IEEE Trans. on Inform. Theory , vol.56 , pp. 6253-6264
    • Korada, S.1    Sasoglu, E.2    Urbanke, R.3
  • 19
    • 84888077607 scopus 로고    scopus 로고
    • Polarization for arbitrary discrete memoryless channels
    • abs/0908.0302
    • E. Sasoglu E. Telatar, and E. Arikan, "Polarization for arbitrary discrete memoryless channels," CoRR, vol. abs/0908.0302, 2009.
    • (2009) CoRR
    • Sasoglu, E.1    Telatar, E.2    Arikan, E.3
  • 20
    • 84872557415 scopus 로고    scopus 로고
    • Polar codes for q-ary channels, q = 2r
    • Feb
    • W. Park and A. Barg, "Polar codes for q-ary channels, q = 2r," IEEE Trans. on Inform. Theory, vol. 59, pp. 955-969, Feb. 2013.
    • (2013) IEEE Trans. on Inform. Theory , vol.59 , pp. 955-969
    • Park, W.1    Barg, A.2
  • 22
  • 23
    • 84890410925 scopus 로고    scopus 로고
    • Polar codes for broadcast channels
    • abs/1301.6150 Jan
    • N. Goela, E. Abbe, and M. Gastpar, "Polar codes for broadcast channels," CoRR, vol. abs/1301.6150, Jan. 2013.
    • (2013) CoRR
    • Goela, N.1    Abbe, E.2    Gastpar, M.3


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