메뉴 건너뛰기




Volumn 43, Issue 3, 1997, Pages 1013-1021

On the decoding of reed-solomon and BCH codes over integer residue rings

Author keywords

BCH codes over q; Error location numbers; Forney's procedure; Galois extension of q; Modified Berlekamp Massey algorithm for commutative rings; Reed solomon codes over q; Syndrome calculation

Indexed keywords

ALGORITHMS; CALCULATIONS; CODING ERRORS; DECODING; ERROR ANALYSIS; FUNCTION EVALUATION; THEOREM PROVING;

EID: 0031139384     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.568713     Document Type: Article
Times cited : (43)

References (24)
  • 4
    • 0015345949 scopus 로고
    • Codes over certain rings
    • I. F. Blake, "Codes over certain rings," Inform. Contr., vol. 20, pp. 396-404, 1972.
    • (1972) Inform. Contr. , vol.20 , pp. 396-404
    • Blake, I.F.1
  • 5
    • 0016619337 scopus 로고
    • Codes over integer residue rings
    • _, "Codes over integer residue rings," Inform. Contr., vol. 29, pp. 295-300, 1975.
    • (1975) Inform. Contr. , vol.29 , pp. 295-300
  • 8
    • 0342603143 scopus 로고
    • On the construction of group block codes
    • Sept.-Oct.
    • E. Biglieri and M. Elia, "On the construction of group block codes," Ann. des Télécomm., vol. 50, no. 9-10, pp. 817-823, Sept.-Oct. 1995.
    • (1995) Ann. des Télécomm. , vol.50 , Issue.9-10 , pp. 817-823
    • Biglieri, E.1    Elia, M.2
  • 11
    • 0026219341 scopus 로고
    • A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes
    • Sept.
    • G. L. Feng and K. K. Tzeng, "A generalization of the Berlekamp-Massey algorithm for multisequence shift-register synthesis with applications to decoding cyclic codes," IEEE Trans. Inform. Theory, vol. 37, pp. 1274-1287, Sept. 1991.
    • (1991) IEEE Trans. Inform. Theory , vol.37 , pp. 1274-1287
    • Feng, G.L.1    Tzeng, K.K.2
  • 12
    • 84938015310 scopus 로고
    • On decoding BCH codes
    • Oct.
    • G. D. Forney, Jr., "On decoding BCH codes," IEEE Trans. Inform. Theory, vol. IT-11, pp. 549-557, Oct. 1965.
    • (1965) IEEE Trans. Inform. Theory , vol.IT-11 , pp. 549-557
    • Forney Jr., G.D.1
  • 15
    • 84894313875 scopus 로고    scopus 로고
    • Modified Berlekamp-Massey algorithm for decoding BCH codes defined over rings
    • Trondheim, Norway
    • J. C. Interlando and R. Palazzo, Jr., "Modified Berlekamp-Massey algorithm for decoding BCH codes defined over rings," in Proc. IEEE Int. Symp. on Information Theory (Trondheim, Norway), p. 94.
    • Proc. IEEE Int. Symp. on Information Theory , pp. 94
    • Interlando, J.C.1    Palazzo Jr., R.2
  • 19
    • 84937740421 scopus 로고
    • Shift-register synthesis and BCH decoding
    • Jan.
    • J. L. Massey, "Shift-register synthesis and BCH decoding," IEEE Trans. Inform. Theory, vol. IT-15, pp. 122-127, Jan. 1969.
    • (1969) IEEE Trans. Inform. Theory , vol.IT-15 , pp. 122-127
    • Massey, J.L.1
  • 23
    • 0028460853 scopus 로고
    • Lee-metric BCH codes and their application to constrained and partial-response channels
    • July
    • R. M. Roth and P. H Siegel, "Lee-metric BCH codes and their application to constrained and partial-response channels," IEEE Trans. Inform. Theory, vol. 40, pp. 1083-1096, July 1994.
    • (1994) IEEE Trans. Inform. Theory , vol.40 , pp. 1083-1096
    • Roth, R.M.1    Siegel, P.H.2
  • 24
    • 0018491389 scopus 로고
    • On BCH codes over arbitrary integer rings
    • July
    • P. Shankar, "On BCH codes over arbitrary integer rings," IEEE Trans. Inform. Theory, vol. IT-25, pp. 480-483, July 1979.
    • (1979) IEEE Trans. Inform. Theory , vol.IT-25 , pp. 480-483
    • Shankar, P.1


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