메뉴 건너뛰기




Volumn 51, Issue 9, 2003, Pages 1463-1473

Algebraic decoding of (71, 36, 11), (79, 40, 15), and (97, 49, 15) quadratic residue codes

Author keywords

Error locator polynomial; Inverse free Berlekamp Massey (BM) algorithm; Quadratic residues (QRs); Unknown syndromes

Indexed keywords

ALGEBRA; COMPUTER SIMULATION; ERROR ANALYSIS; NUMERICAL METHODS; POLYNOMIALS;

EID: 0141885942     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.2003.816994     Document Type: Article
Times cited : (76)

References (18)
  • 3
    • 84943817322 scopus 로고
    • Error detecting and error correcting codes
    • R. W. Hamming, "Error detecting and error correcting codes," Bell Syst. Tech. J., vol. 29, pp. 147-160, 1950.
    • (1950) Bell Syst. Tech. J. , vol.29 , pp. 147-160
    • Hamming, R.W.1
  • 4
    • 0000499681 scopus 로고
    • Notes on digital coding
    • M. J. E. Golay, "Notes on digital coding," Proc. IRE, vol. 37, p. 67, 1949.
    • (1949) Proc. IRE , vol.37 , pp. 67
    • Golay, M.J.E.1
  • 5
    • 0025434051 scopus 로고
    • Decoding the (24, 12, 8) Golay code
    • May
    • I. S. Reed, X. Yin, T. K. Truong, and J. K. Holmes, "Decoding the (24, 12, 8) Golay code," Proc. IEE, vol. 137, pp. 202-206, May 1990.
    • (1990) Proc. IEE , vol.137 , pp. 202-206
    • Reed, I.S.1    Yin, X.2    Truong, T.K.3    Holmes, J.K.4
  • 6
    • 0023207947 scopus 로고
    • Algebraic decoding of the (23, 12, 7) Golay code
    • Jan.
    • M. Elia, "Algebraic decoding of the (23, 12, 7) Golay code," IEEE Trans. Inform. Theory, vol. IT-33, pp. 150-151, Jan. 1987.
    • (1987) IEEE Trans. Inform. Theory , vol.IT-33 , pp. 150-151
    • Elia, M.1
  • 7
    • 0025465298 scopus 로고
    • Algebraic decoding of the (32, 16, 8) quadratic residue code
    • July
    • I. S. Reed, X. Yin, and T. K. Truong, "Algebraic decoding of the (32, 16, 8) quadratic residue code," IEEE Trans. Inform. Theory, vol. 36, pp. 876-880, July 1990.
    • (1990) IEEE Trans. Inform. Theory , vol.36 , pp. 876-880
    • Reed, I.S.1    Yin, X.2    Truong, T.K.3
  • 9
    • 0026867992 scopus 로고
    • The algebraic decoding of the (41, 21, 9) quadratic residue code
    • May
    • I. S. Reed, T. K. Truong, X. Chen, and X. Yin, "The algebraic decoding of the (41, 21, 9) quadratic residue code," IEEE Trans. Inform. Theory, vol. 38, pp. 974-985, May 1992.
    • (1992) IEEE Trans. Inform. Theory , vol.38 , pp. 974-985
    • Reed, I.S.1    Truong, T.K.2    Chen, X.3    Yin, X.4
  • 10
    • 0035271102 scopus 로고    scopus 로고
    • Decoding the (47, 24, 11) quadratic residue code
    • Mar.
    • R. He, I. S. Reed, T. K. Truong, and X. Chen, "Decoding the (47, 24, 11) quadratic residue code," IEEE Trans. Inform. Theory, vol. 47, pp. 1181-1186, Mar. 2001.
    • (2001) IEEE Trans. Inform. Theory , vol.47 , pp. 1181-1186
    • He, R.1    Reed, I.S.2    Truong, T.K.3    Chen, X.4
  • 11
    • 0028510673 scopus 로고
    • Decoding the (73, 37, 13) quadratic residue code
    • Sept.
    • X. Chen, I. S. Reed, and T. K. Truong, "Decoding the (73, 37, 13) quadratic residue code," Proc. IEE, vol. 141, pp. 253-258, Sept. 1994.
    • (1994) Proc. IEE , vol.141 , pp. 253-258
    • Chen, X.1    Reed, I.S.2    Truong, T.K.3
  • 12
    • 0026222469 scopus 로고
    • VLSI design of inverse-free Berlekamp-Massey algorithm
    • Sept.
    • I. S. Reed, M. T. Shih, and T. K. Truong, "VLSI design of inverse-free Berlekamp-Massey algorithm," Proc. IEE, vol. 138, pp. 295-298, Sept. 1991.
    • (1991) Proc. IEE , vol.138 , pp. 295-298
    • Reed, I.S.1    Shih, M.T.2    Truong, T.K.3
  • 13
    • 0026169911 scopus 로고
    • Implementation of Berlekamp-Massey algorithm without inversion
    • X. Youzhi, "Implementation of Berlekamp-Massey algorithm without inversion," Proc. IEE, vol. 138, no. 3, pp. 138-140, 1991.
    • (1991) Proc. IEE , vol.138 , Issue.3 , pp. 138-140
    • Youzhi, X.1
  • 15
    • 0028514932 scopus 로고
    • A new procedure for decoding cyclic and BCH codes up to actual minimum distance
    • Sept.
    • G. L. Feng and K. K. Tzeng, "A new procedure for decoding cyclic and BCH codes up to actual minimum distance," IEEE Trans. Inform. Theory, vol. 40, pp. 1364-1374, Sept. 1994.
    • (1994) IEEE Trans. Inform. Theory , vol.40 , pp. 1364-1374
    • Feng, G.L.1    Tzeng, K.K.2
  • 18
    • 0035334168 scopus 로고    scopus 로고
    • Fast algorithm for computing the roots of error locator polynomials up to degree 11 in Reed-Solomon decoders
    • May
    • T. K. Truong, J. H. Jeng, and I. S. Reed, "Fast algorithm for computing the roots of error locator polynomials up to degree 11 in Reed-Solomon decoders," IEEE Trans. Commun., vol. 49, pp. 779-783, May 2001.
    • (2001) IEEE Trans. Commun. , vol.49 , pp. 779-783
    • Truong, T.K.1    Jeng, J.H.2    Reed, I.S.3


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