메뉴 건너뛰기




Volumn 43, Issue 5, 1997, Pages 1477-1488

On acceptance criterion for efficient successive errors-and-erasures decoding of reed-solomon and BCH codes

Author keywords

Decoding algorithms; Decoding complexity; Generalized minimum distance decoding; Reed Solomon codes; Soft decisions; Successive errors and erasures decoding

Indexed keywords

ALGORITHMS; BLOCK CODES; CODING ERRORS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; FADING (RADIO); PERFORMANCE; POLYNOMIALS; WHITE NOISE;

EID: 0031234379     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.623146     Document Type: Article
Times cited : (9)

References (9)
  • 1
    • 0030150111 scopus 로고    scopus 로고
    • Bounded distance +1 soft-decision Reed-Solomon decoding
    • May
    • E. R. Berlekamp, "Bounded distance +1 soft-decision Reed-Solomon decoding," IEEE Trans. Inform. Theory, vol. 42, pp. 704-720, May 1996.
    • (1996) IEEE Trans. Inform. Theory , vol.42 , pp. 704-720
    • Berlekamp, E.R.1
  • 2
    • 0016874168 scopus 로고
    • A note on soft decision decoding with successive erasures
    • Jan.
    • G. Einarsson and C. Sundberg, "A note on soft decision decoding with successive erasures," IEEE Trans. Inform. Theory, vol. IT-22, pp. 88-96, Jan. 1976.
    • (1976) IEEE Trans. Inform. Theory , vol.IT-22 , pp. 88-96
    • Einarsson, G.1    Sundberg, C.2
  • 3
    • 33746350704 scopus 로고
    • Generalized minimum distance decoding
    • Apr.
    • G. D. Forney, Jr., "Generalized minimum distance decoding," IEEE Trans. Inform. Theory, vol. IT-12, pp. 125-131, Apr. 1966.
    • (1966) IEEE Trans. Inform. Theory , vol.IT-12 , pp. 125-131
    • Forney Jr., G.D.1
  • 4
    • 0001513627 scopus 로고
    • On multisequence shift register synthesis and generalized-minimum-distance decoding of Reed-Solomon codes
    • Oct.
    • N. Kamiya, "On multisequence shift register synthesis and generalized-minimum-distance decoding of Reed-Solomon codes," Finite Fields and Their Applications, vol. 1, no. 4, pp. 440-457, Oct. 1995.
    • (1995) Finite Fields and Their Applications , vol.1 , Issue.4 , pp. 440-457
    • Kamiya, N.1
  • 5
    • 0015286180 scopus 로고
    • Random error and burst error correction by iterated codes
    • Jan.
    • S. M. Reddy and J. P. Robinson, "Random error and burst error correction by iterated codes," IEEE Trans. Inform. Theory, vol. IT-18, pp. 182-185, Jan. 1972.
    • (1972) IEEE Trans. Inform. Theory , vol.IT-18 , pp. 182-185
    • Reddy, S.M.1    Robinson, J.P.2
  • 6
    • 0027559038 scopus 로고
    • A new Reed-Solomon code decoding algorithm based on Newton's interpolation
    • Mar.
    • U. K. Sorger, "A new Reed-Solomon code decoding algorithm based on Newton's interpolation," IEEE Trans. Inform. Theory, vol. 39, pp. 358-365, Mar. 1993.
    • (1993) IEEE Trans. Inform. Theory , vol.39 , pp. 358-365
    • Sorger, U.K.1
  • 8
    • 0026018282 scopus 로고
    • An improvement to generalized-minimum-distance decoding
    • Jan.
    • D. J. Taipale and M. B. Pursley, "An improvement to generalized-minimum-distance decoding," IEEE Trans. Inform. Theory, vol. 37, pp. 167-172, Jan. 1991.
    • (1991) IEEE Trans. Inform. Theory , vol.37 , pp. 167-172
    • Taipale, D.J.1    Pursley, M.B.2
  • 9
    • 0028460368 scopus 로고
    • An efficient soft-decision Reed-Solomon decoding algorithm
    • July
    • D. J. Taipale and M. J. Seo, "An efficient soft-decision Reed-Solomon decoding algorithm," IEEE Trans. Inform. Theory, vol. 40, pp. 1130-1139, July 1994.
    • (1994) IEEE Trans. Inform. Theory , vol.40 , pp. 1130-1139
    • Taipale, D.J.1    Seo, M.J.2


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