메뉴 건너뛰기




Volumn , Issue , 2007, Pages 1361-1365

Cascaded formulation of the fundamental polytope of general linear block codes

Author keywords

[No Author keywords available]

Indexed keywords

INTERNATIONAL SYMPOSIUM; POLYTOPE;

EID: 48849091623     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2007.4557412     Document Type: Conference Paper
Times cited : (15)

References (11)
  • 1
    • 51649097832 scopus 로고    scopus 로고
    • Decoding Error-Correcting Codes via Linear Programming. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA
    • J. Feldman, Decoding Error-Correcting Codes via Linear Programming. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA, 2003.
    • (2003)
    • Feldman, J.1
  • 2
    • 3042677900 scopus 로고    scopus 로고
    • Linear programming-based decoding of turbo-like codes and its relation to iterative approaches
    • Allerton, IL, USA, Oct
    • J. Feldman, D. R. Karger, and M. J. Wainwright, "Linear programming-based decoding of turbo-like codes and its relation to iterative approaches," Proc. 40th Anu. Aüerton Conf. Commun, Contr, & Comput., pp. 250-260, Allerton, IL, USA, Oct. 2002.
    • (2002) Proc. 40th Anu. Aüerton Conf. Commun, Contr, & Comput , pp. 250-260
    • Feldman, J.1    Karger, D.R.2    Wainwright, M.J.3
  • 3
    • 15044355718 scopus 로고    scopus 로고
    • Using linear programming to decode binary linear codes
    • Jan
    • J. Feldman, M. J. Wainwright, and D. R. Karger, "Using linear programming to decode binary linear codes," IEEE Trans. Inform. Theory, vol. 51, pp. 954-972, Jan. 2005.
    • (2005) IEEE Trans. Inform. Theory , vol.51 , pp. 954-972
    • Feldman, J.1    Wainwright, M.J.2    Karger, D.R.3
  • 5
    • 84888034719 scopus 로고    scopus 로고
    • Graph-cover decoding and finite-length analysis of message-passing iterative decoding of LDPC codes
    • submitted to, Available at
    • P. O. Vontobel and R. Koetter, "Graph-cover decoding and finite-length analysis of message-passing iterative decoding of LDPC codes," submitted to IEEE Trans. Inform. Theory. Available at http://www.arxiv.org/abs/cs.IT/0512078.
    • IEEE Trans. Inform. Theory
    • Vontobel, P.O.1    Koetter, R.2
  • 6
    • 33746626860 scopus 로고    scopus 로고
    • On the relationship between linear programming decoding and min-sum algorithm decoding
    • Parma, Italy, Oct
    • P. O. Vontobel and R. Koetter, "On the relationship between linear programming decoding and min-sum algorithm decoding," Proc. Int'l. Symp. Inform. Theory & its Applications, pp. 991-996, Parma, Italy, Oct. 2004.
    • (2004) Proc. Int'l. Symp. Inform. Theory & its Applications , pp. 991-996
    • Vontobel, P.O.1    Koetter, R.2
  • 7
    • 33744493152 scopus 로고    scopus 로고
    • Relaxation bounds on the minimum pseudo-weight of linear block codes
    • Adelaide, Australia, Sept
    • P. Chaichanavong and P. H. Siegel, "Relaxation bounds on the minimum pseudo-weight of linear block codes," Proc. IEEE Int'l Symp. Inform. Theory, pp. 805-809, Adelaide, Australia, Sept. 2005.
    • (2005) Proc. IEEE Int'l Symp. Inform. Theory , pp. 805-809
    • Chaichanavong, P.1    Siegel, P.H.2
  • 8
    • 33747205461 scopus 로고    scopus 로고
    • Non-linear programming approaches to decoding low-density parity-check codes
    • Aug
    • K. Yang, J. Feldman, and X. Wang, "Non-linear programming approaches to decoding low-density parity-check codes," IEEE J. Select. Areas Commun., vol. 24, pp. 1603-1613, Aug. 2006.
    • (2006) IEEE J. Select. Areas Commun , vol.24 , pp. 1603-1613
    • Yang, K.1    Feldman, J.2    Wang, X.3


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