메뉴 건너뛰기




Volumn 52, Issue 11, 2006, Pages 4867-4879

On the stopping redundancy of Reed-Muller codes

Author keywords

Iterative decoding on binary erasure channel; Reed Muller codes; Simplex codes; Stopping distance; Stopping redundancy; Stopping sets

Indexed keywords

DECODING; ITERATIVE METHODS; MATRIX ALGEBRA; RECURSIVE FUNCTIONS; REDUNDANCY;

EID: 33750579469     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2006.883542     Document Type: Article
Times cited : (31)

References (9)
  • 1
    • 0036612281 scopus 로고    scopus 로고
    • "Finite length analysis of low-density parity-check codes on the binary erasure channel"
    • Jun
    • C. Di, D. Proietti, I.E. Telatar, T. J. Richardson, and R. L. Urbanke, "Finite length analysis of low-density parity-check codes on the binary erasure channel," IEEE Trans. Inf. Theory, vol. 48, no. 6, pp. 1570-1579, Jun. 2002.
    • (2002) IEEE Trans. Inf. Theory , vol.48 , Issue.6 , pp. 1570-1579
    • Di, C.1    Proietti, D.2    Telatar, I.E.3    Richardson, T.J.4    Urbanke, R.L.5
  • 2
    • 33750576457 scopus 로고    scopus 로고
    • "Improved upper bounds on stopping redundancy"
    • submitted for publication
    • J. Han and P. H. Siegel, "Improved upper bounds on stopping redundancy," IEEE Trans. Inf. Theory, submitted for publication.
    • IEEE Trans. Inf. Theory
    • Han, J.1    Siegel, P.H.2
  • 3
    • 33847646191 scopus 로고    scopus 로고
    • "On parity check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size"
    • submitted for publication
    • H. D. L. Hollmann and L. M. G. M. Tolhuizen, "On parity check collections for iterative erasure decoding that correct all correctable erasure patterns of a given size," IEEE Trans. Inf. Theory, submitted for publication.
    • IEEE Trans. Inf. Theory
    • Hollmann, H.D.L.1    Tolhuizen, L.M.G.M.2
  • 4
    • 0141973785 scopus 로고    scopus 로고
    • "Stopping sets in codes from designs"
    • in Yokohama, Japan, Jun./Jul
    • N. Kashyap and A. Vardy, "Stopping sets in codes from designs," in Proc. IEEE Int. Symp. Information Theory, Yokohama, Japan, Jun./Jul. 2003, p. 122.
    • (2003) Proc. IEEE Int. Symp. Information Theory , pp. 122
    • Kashyap, N.1    Vardy, A.2
  • 7
    • 15044364240 scopus 로고    scopus 로고
    • "Stopping set distribution of LDPC code ensembles"
    • Mar
    • A. Orlitsky, K. Viswananathan, and J. Zhang, "Stopping set distribution of LDPC code ensembles," IEEE Trans. Inf. Theory, vol. 51, no. 3, pp. 929-953, Mar. 2005.
    • (2005) IEEE Trans. Inf. Theory , vol.51 , Issue.3 , pp. 929-953
    • Orlitsky, A.1    Viswananathan, K.2    Zhang, J.3
  • 8
    • 33748448633 scopus 로고    scopus 로고
    • "On the stopping distance and the stopping redundancy of codes"
    • Mar
    • M. Schwartz and A. Vardy, "On the stopping distance and the stopping redundancy of codes," IEEE Trans. Inf. Theory, vol. 52, no. 3, pp. 922-932, Mar. 2006.
    • (2006) IEEE Trans. Inf. Theory , vol.52 , Issue.3 , pp. 922-932
    • Schwartz, M.1    Vardy, A.2


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