메뉴 건너뛰기




Volumn 40, Issue 1, 1994, Pages 223-229

Fast Decoding of Codes from Algebraic Curves

Author keywords

Algebraic geometric codes; fast decoding

Indexed keywords

ALGEBRA; ALGORITHMS; CODING ERRORS; COMPUTATIONAL COMPLEXITY; DECODING; ENCODING (SYMBOLS); ERROR CORRECTION; GEOMETRY; POLES AND ZEROS; POLYNOMIALS;

EID: 0028262090     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/18.272487     Document Type: Article
Times cited : (14)

References (11)
  • 2
    • 0025484013 scopus 로고
    • On the decoding of algebraic-geometric codes
    • Sept.
    • A. N. Skorobogatov and S. G. Vlădut, “On the decoding of algebraic-geometric codes,” IEEE Trans. Inform. Theory, vol. 36, pp. 1051-1061, Sept. 1990.
    • (1990) IEEE Trans. Inform. Theory , vol.36 , pp. 1051-1061
    • Skorobogatov, A.N.1    Vlădut, S.G.2
  • 3
    • 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
  • 4
    • 0026678417 scopus 로고
    • Fast decoding of codes from algebraic plane curves
    • Jan.
    • J. Justesen et al., “Fast decoding of codes from algebraic plane curves,” IEEE Trans. Inform. Theory, vol. 38, pp. 111-120, Jan. 1992.
    • (1992) IEEE Trans. Inform. Theory , vol.38 , pp. 111-120
    • Justesen, J.1
  • 5
    • 0025383036 scopus 로고
    • Extension of the Berlekamp-Massey algorithm to N dimensions
    • S. Sakata, “Extension of the Berlekamp-Massey algorithm to N dimensions,” Inform. Computation, vol. 84, no. 2, pp. 207-239, 1990.
    • (1990) Inform. Computation , vol.84 , Issue.2 , pp. 207-239
    • Sakata, S.1
  • 6
    • 84947662739 scopus 로고
    • Codes and geometry
    • May
    • C. Dahl Jensen, “Codes and geometry,” Ph.D. dissertation, Mathematical Inst., Technical Univ. Denmark, May 1991.
    • (1991) Ph.D. dissertation
    • Dahl Jensen, C.1
  • 7
    • 0024766653 scopus 로고
    • On a decoding algorithm for codes on maximal curves
    • R. Pellikaan, “On a decoding algorithm for codes on maximal curves,” IEEE Trans. Inform. Theory, vol. 35, no. 6, pp. 1228-1232, 1989.
    • (1989) IEEE Trans. Inform. Theory , vol.35 , Issue.6 , pp. 1228-1232
    • Pellikaan, R.1
  • 8
    • 0142229300 scopus 로고
    • Decoding codes arising from Goppa’s construction on algebraic curves
    • Dec.
    • S. C. Porter, “Decoding codes arising from Goppa’s construction on algebraic curves,” thesis, Yale Univ., Dec. 1988.
    • (1988) thesis
    • Porter, S.C.1
  • 9
    • 84947669330 scopus 로고
    • On Porter’s decoding algorithm of algebraic-geometric codes
    • B. Z. Shen and R. Pellikaan, “On Porter’s decoding algorithm of algebraic-geometric codes,” preprint, 1991.
    • (1991) preprint
    • Shen, B.Z.1    Pellikaan, R.2
  • 10
    • 84947666795 scopus 로고
    • On the various decoding algorithms for algebraic-geometric codes
    • D. Erhard, “On the various decoding algorithms for algebraic-geometric codes,” preprint, 1991.
    • (1991) preprint
    • Erhard, D.1


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