메뉴 건너뛰기




Volumn 53, Issue 11, 2007, Pages 4013-4038

Pseudocodewords of tanner graphs

Author keywords

Iterative decoding; Low density parity check (LDPC) codes; Min sum iterative decoder; Pseudocodewords

Indexed keywords

BINARY CODES; CHANNEL CODING; GRAPH THEORY; ITERATIVE DECODING;

EID: 36348999345     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2007.907501     Document Type: Article
Times cited : (64)

References (23)
  • 1
    • 36348962308 scopus 로고    scopus 로고
    • N. Wiberg, Codes and decoding on general graphs, Ph.D. dissertation, Univ. Linköping, Linköping, Sweden, 1996.
    • N. Wiberg, "Codes and decoding on general graphs," Ph.D. dissertation, Univ. Linköping, Linköping, Sweden, 1996.
  • 2
    • 0004147949 scopus 로고    scopus 로고
    • Iterative decoding and pseudocodewords,
    • Ph.D. dissertation, Calif. Inst. Technol, Pasadena, CA
    • G. A. Horn, "Iterative decoding and pseudocodewords," Ph.D. dissertation, Calif. Inst. Technol., Pasadena, CA, 1999.
    • (1999)
    • Horn, G.A.1
  • 4
    • 0008117743 scopus 로고    scopus 로고
    • On the effective weights of pseudocodewords for codes defined on graphs with cycles
    • New York: Springer
    • G. D. Forney, Jr., R. Koetter, F. R. Kschischang, and A. Reznik, "On the effective weights of pseudocodewords for codes defined on graphs with cycles," in Codes, Systems, and Graphical Models. New York: Springer, 2001, pp. 101-112.
    • (2001) Codes, Systems, and Graphical Models , pp. 101-112
    • Forney Jr., G.D.1    Koetter, R.2    Kschischang, F.R.3    Reznik, A.4
  • 6
    • 0035246366 scopus 로고    scopus 로고
    • Signal-space characterization of iterative decoding
    • Feb
    • B. J. Frey, R. Koetter, and A. Vardy, "Signal-space characterization of iterative decoding," IEEE Trans. Inf. Theory, vol. 47, pp. 766-781, Feb. 2001.
    • (2001) IEEE Trans. Inf. Theory , vol.47 , pp. 766-781
    • Frey, B.J.1    Koetter, R.2    Vardy, A.3
  • 7
    • 2642581618 scopus 로고    scopus 로고
    • Decoding error-correcting codes via linear programming,
    • Ph.D. dissertation, Mass. Inst. Technol, Cambridge, MA
    • J. Feldman, "Decoding error-correcting codes via linear programming," Ph.D. dissertation, Mass. Inst. Technol., Cambridge, MA, 2003.
    • (2003)
    • Feldman, J.1
  • 11
    • 0036612281 scopus 로고    scopus 로고
    • Finite-length analysis of low-density parity-check codes on the binary erasure channel
    • Jun
    • C. Di, D. Proietti, I. Teletar, T. Richardson, and R. Urbanke, "Finite-length analysis of low-density parity-check codes on the binary erasure channel," IEEE Trans. Inf. Theory, vol. 48, pp. 1570-1579, Jun. 2002.
    • (2002) IEEE Trans. Inf. Theory , vol.48 , pp. 1570-1579
    • Di, C.1    Proietti, D.2    Teletar, I.3    Richardson, T.4    Urbanke, R.5
  • 12
    • 0035246564 scopus 로고    scopus 로고
    • Factor graphs and the sum-product algorithm
    • Feb
    • F. R. Kschischang, B. J. Frey, and H. A. Loeligar, "Factor graphs and the sum-product algorithm," IEEE Trans. Inf. Theory, vol. 47, no. 2, pp. 498-519, Feb. 2001.
    • (2001) IEEE Trans. Inf. Theory , vol.47 , Issue.2 , pp. 498-519
    • Kschischang, F.R.1    Frey, B.J.2    Loeligar, H.A.3
  • 13
    • 0019608335 scopus 로고
    • A recursive approach to low complexity codes
    • Sep
    • R. M. Tanner, "A recursive approach to low complexity codes," IEEE Trans. Inf. Theory, vol. IT-27, pp. 533-547, Sep. 1981.
    • (1981) IEEE Trans. Inf. Theory , vol.IT-27 , pp. 533-547
    • Tanner, R.M.1
  • 15
    • 33749429110 scopus 로고    scopus 로고
    • LP decoding achieves capacity
    • Vancouver, Canada, Jan. 23-25
    • J. Feldman and C. Stein, "LP decoding achieves capacity," in Symp. Discrete Algorithms (SODA), Vancouver, Canada, Jan. 23-25, 2005.
    • (2005) Symp. Discrete Algorithms (SODA)
    • Feldman, J.1    Stein, C.2
  • 17
    • 0035504019 scopus 로고    scopus 로고
    • Low density parity-check codes based on finite geometries: A rediscovery and new results
    • Nov
    • Y. Kou, S. Lin, and M. P. C. Fossorier, "Low density parity-check codes based on finite geometries: A rediscovery and new results," IEEE Trans. Inf. Theory, vol. 47, pp. 2711-2736, Nov. 2001.
    • (2001) IEEE Trans. Inf. Theory , vol.47 , pp. 2711-2736
    • Kou, Y.1    Lin, S.2    Fossorier, M.P.C.3
  • 18
    • 33646561096 scopus 로고    scopus 로고
    • On the stopping distance and the stopping redundancy of codes
    • Mar, submitted for publication
    • M. Schwartz and A. Vardy, "On the stopping distance and the stopping redundancy of codes," IEEE Trans. Inf. Theory, Mar. 2005, submitted for publication.
    • (2005) IEEE Trans. Inf. Theory
    • Schwartz, M.1    Vardy, A.2
  • 21
    • 0033907315 scopus 로고    scopus 로고
    • The generalized distributive law
    • Mar
    • S. M. Aji and R. J. McEliece, "The generalized distributive law," IEEE Trans. Inf. Theory, vol. 46, pp. 325-343, Mar. 2000.
    • (2000) IEEE Trans. Inf. Theory , vol.46 , pp. 325-343
    • Aji, S.M.1    McEliece, R.J.2
  • 23
    • 33746626860 scopus 로고    scopus 로고
    • On the relationship between linear programming decoding and min-sum algorithm decoding
    • Parma, Italy, Oct. 10-13
    • P. O. Vontobel and R. Koetter, "On the relationship between linear programming decoding and min-sum algorithm decoding," in Proc. 2004 Int. Symp. Inf. Theory Applications, Parma, Italy, Oct. 10-13, 2004.
    • (2004) Proc. 2004 Int. Symp. Inf. Theory Applications
    • Vontobel, P.O.1    Koetter, R.2


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