메뉴 건너뛰기




Volumn 47, Issue 1, 2001, Pages 45-58

On algebraic soft-decision decoding algorithms for BCH codes

Author keywords

Bose Chaudhuri Hocquenghem (BCH) codes; Bounded distance +t GMD decoding; Chase decoding; Decoding complexity; Generalized minimum distance (GMD) decoding; Soft decision decoding

Indexed keywords

ADDITIVE WHITE GAUSSIAN NOISE; BOSE-CHAUDHURI-HOCQUENGHAM CODES; CHASE DECODING; GENERALIZED MINIMUM-DISTANCE DECODING; SOFT DECISION DECODING ALGORITHMS;

EID: 0035094214     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.904511     Document Type: Article
Times cited : (30)

References (22)
  • 11
    • 0001513627 scopus 로고
    • On multisequence shift register synthesis and generalized minimum distance decoding of Reed-Solomon codes
    • Oct.
    • (1995) Finite Fields Their Applic. , vol.1 , Issue.4 , pp. 440-457
    • Kamiya, N.1
  • 12
    • 0031234379 scopus 로고    scopus 로고
    • On acceptance criterion for efficient successive errors-and-erasures decoding of Reed-Solomon and BCH codes
    • Sept.
    • (1997) IEEE Trans. Inform. Theory , vol.43 , pp. 1477-1488
    • Kamiya, N.1


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