메뉴 건너뛰기




Volumn , Issue , 2011, Pages 2816-2820

Spatially coupled codes over the multiple access channel

Author keywords

[No Author keywords available]

Indexed keywords

BELIEF PROPAGATION; BINARY ERASURE CHANNEL; COUPLED CODE; DENSITY EVOLUTION ANALYSIS; MAXIMUM A POSTERIORI; MEMORYLESS; MULTIPLE ACCESS CHANNELS; SHANNON LIMIT; SYMMETRIC CHANNELS;

EID: 80054815872     PISSN: 21578104     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2011.6034088     Document Type: Conference Paper
Times cited : (47)

References (14)
  • 1
    • 0033184966 scopus 로고    scopus 로고
    • Time-varying periodic convolutional codes with low-density parity-check matrix
    • Sept
    • A. J. Felstrom and K. S. Zigangirov, "Time-varying periodic convolutional codes with low-density parity-check matrix", IEEE Trans. Inform. Theory, vol. 45, no. 5, pp. 2181-2190, Sept. 1999.
    • (1999) IEEE Trans. Inform. Theory , vol.45 , Issue.5 , pp. 2181-2190
    • Felstrom, A.J.1    Zigangirov, K.S.2
  • 3
    • 77955700139 scopus 로고    scopus 로고
    • On the thresholds of generalized LDPC convolutional codes based on protographs
    • Austing, TX, USA, June
    • M. Lentmaier and G. P. Fettweis, "On the thresholds of generalized LDPC convolutional codes based on protographs", in Proc. of the IEEE Int. Symposium on Inform. Theory, Austing, TX, USA, June 2010, pp. 709-713.
    • (2010) Proc. of the IEEE Int. Symposium on Inform. Theory , pp. 709-713
    • Lentmaier, M.1    Fettweis, G.P.2
  • 5
    • 70350710226 scopus 로고    scopus 로고
    • The generalized area theorem and some of its consequences
    • Nov
    • C. Measson, A. Montanari, T. Richardson, and R. Urbanke, "The generalized area theorem and some of its consequences", IEEE Trans. Inform. Theory, vol. 55, no. 11, pp. 4793-4821, Nov. 2009.
    • (2009) IEEE Trans. Inform. Theory , vol.55 , Issue.11 , pp. 4793-4821
    • Measson, C.1    Montanari, A.2    Richardson, T.3    Urbanke, R.4
  • 7
    • 67650099990 scopus 로고    scopus 로고
    • Channel polarization: A method for constructing capacityachieving codes for symmetric binary-input memoryless channels
    • E. Arikan, "Channel polarization: A method for constructing capacityachieving codes for symmetric binary-input memoryless channels", IEEE Tram. Inform. Theory, vol. 55, no. 7, pp. 3051-3073, 2009.
    • (2009) IEEE Tram. Inform. Theory , vol.55 , Issue.7 , pp. 3051-3073
    • Arikan, E.1
  • 8
    • 0035246127 scopus 로고    scopus 로고
    • Design of capacityapproaching irregular low-density parity-check codes
    • Feb
    • T. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacityapproaching irregular low-density parity-check codes", IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 619-637, Feb. 2001.
    • (2001) IEEE Trans. Inform. Theory , vol.47 , Issue.2 , pp. 619-637
    • Richardson, T.1    Shokrollahi, A.2    Urbanke, R.3
  • 14
    • 0036350204 scopus 로고    scopus 로고
    • Achieving general points in the 2-user Gaussian MAC without time-sharing or rate-splitting by means of iterative coding
    • Lausanne, Switzerland, June, conference
    • A. Amraoui, S. Dusad, and R. Urbanke, "Achieving general points in the 2-user Gaussian MAC without time-sharing or rate-splitting by means of iterative coding", in Proc. of the IEEE Int. Symposium on Inform. Theory, Lausanne, Switzerland, June 2002, conference, p. 334.
    • (2002) Proc. of the IEEE Int. Symposium on Inform. Theory , pp. 334
    • Amraoui, A.1    Dusad, S.2    Urbanke, R.3


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