메뉴 건너뛰기




Volumn 49, Issue 11, 2003, Pages 2809-2825

Algebraic Soft-Decision Decoding of Reed-Solomon Codes

Author keywords

Berlekamp Welch algorithm; Guruswami Sudan algorithm; List decoding; Polynomial interpolation; Reed Solomon codes; Soft decision decoding

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); DECISION THEORY; DECODING; INTERPOLATION; POLYNOMIALS; QUADRATURE AMPLITUDE MODULATION;

EID: 0345306775     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2003.819332     Document Type: Article
Times cited : (485)

References (32)
  • 1
    • 0034315205 scopus 로고    scopus 로고
    • A Hensel lifting to replace factorization in list-decoding of algebraic-geometric and Reed-Solomon codes
    • Nov.
    • D. Augot and L. Pecquet, "A Hensel lifting to replace factorization in list-decoding of algebraic-geometric and Reed-Solomon codes," IEEE Trans. Inform. Theory, vol. 46, pp. 2605-2614, Nov. 2000.
    • (2000) IEEE Trans. Inform. Theory , vol.46 , pp. 2605-2614
    • Augot, D.1    Pecquet, L.2
  • 2
    • 0016037512 scopus 로고
    • Optimal decoding of linear codes for minimizing symbol error rate
    • Mar.
    • L. R. Bahl, J. Cocke, F. Jelinek, and J. Raviv, "Optimal decoding of linear codes for minimizing symbol error rate," IEEE Trans. Inform. Theory, vol. IT-20, pp. 284-287, Mar. 1974.
    • (1974) IEEE Trans. Inform. Theory , vol.IT-20 , pp. 284-287
    • Bahl, L.R.1    Cocke, J.2    Jelinek, F.3    Raviv, J.4
  • 3
    • 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-721, May 1996.
    • (1996) IEEE Trans. Inform. Theory , vol.42 , pp. 704-721
    • Berlekamp, E.R.1
  • 5
    • 0023331954 scopus 로고
    • The application of error control to communications
    • Jan.
    • E. R. Berlekamp, R. E. Peile, and S. P. Pope, "The application of error control to communications," IEEE Commun. Mag., vol. 25, pp. 44-57, Jan. 1987.
    • (1987) IEEE Commun. Mag. , vol.25 , pp. 44-57
    • Berlekamp, E.R.1    Peile, R.E.2    Pope, S.P.3
  • 7
    • 0344438937 scopus 로고
    • Soft-decision decoding of Reed-Solomon codes
    • S. B. Wicker and V. K. Bhargava, Eds. New York: IEEE Press
    • A. B. Cooper 3rd, "Soft-decision decoding of Reed-Solomon codes," in Reed-Solomon Codes and their Applications, S. B. Wicker and V. K. Bhargava, Eds. New York: IEEE Press, 1994, pp. 108-124.
    • (1994) Reed-Solomon Codes and their Applications , pp. 108-124
    • Cooper III, A.B.1
  • 9
    • 0011957724 scopus 로고    scopus 로고
    • Fast algorithms in Sudan decoding procedure for Reed-Solomon codes
    • submitted for publication
    • G.-L. Feng and X. Giraud, "Fast algorithms in Sudan decoding procedure for Reed-Solomon codes," IEEE Trans. Inform. Theory, submitted for publication.
    • IEEE Trans. Inform. Theory
    • Feng, G.-L.1    Giraud, X.2
  • 10
    • 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
  • 11
    • 0004137776 scopus 로고
    • Cambridge, MA: MIT Press
    • _, Concatenated Codes. Cambridge, MA: MIT Press, 1966.
    • (1966) Concatenated Codes
  • 13
    • 0344007655 scopus 로고    scopus 로고
    • Applications of algebraic soft-decision decoding of Reed-Solomon codes
    • submitted for publication
    • _,"Applications of algebraic soft-decision decoding of Reed-Solomon codes," IEEE Trans. Commun., submitted for publication.
    • IEEE Trans. Commun.
  • 14
    • 0033183669 scopus 로고    scopus 로고
    • Improved decoding of Reed-Solomon and algebraic-geometric codes
    • Sept.
    • V. Guruswami and M. Sudan, "Improved decoding of Reed-Solomon and algebraic-geometric codes," IEEE Trans. Inform. Theory, vol. 45, pp. 1757-1767, Sept. 1999.
    • (1999) IEEE Trans. Inform. Theory , vol.45 , pp. 1757-1767
    • Guruswami, V.1    Sudan, M.2
  • 15
    • 0345301987 scopus 로고    scopus 로고
    • List decoding algorithms for certain concatenated codes
    • submitted for publication
    • _, "List decoding algorithms for certain concatenated codes," IEEE Trans. Inform. Theory, submitted for publication.
    • IEEE Trans. Inform. Theory
  • 17
    • 0030151940 scopus 로고    scopus 로고
    • Fast generalized minimum distance decoding of algebraic geometric and Reed-Solomon codes
    • May
    • _, "Fast generalized minimum distance decoding of algebraic geometric and Reed-Solomon codes," IEEE Trans. Inform. Theory, vol. 42, pp. 721-738, May 1996.
    • (1996) IEEE Trans. Inform. Theory , vol.42 , pp. 721-738
  • 19
    • 0006479312 scopus 로고    scopus 로고
    • Decoding concatenated codes with Sudan's algorithm
    • submitted for publication
    • R. R. Nielsen, "Decoding concatenated codes with Sudan's algorithm," IEEE Trans. Inform. Theory, submitted for publication.
    • IEEE Trans. Inform. Theory
    • Nielsen, R.R.1
  • 21
    • 0344438936 scopus 로고    scopus 로고
    • A displacement structure approach to efficient decoding of Reed-Solomon and algebraic-geometric codes
    • Atlanta, GA, May
    • V. Olshevsky and A. Shokrollahi. "A displacement structure approach to efficient decoding of Reed-Solomon and algebraic-geometric codes," in Proc. 31th ACM Symp. Theory of Computing (STOC), Atlanta, GA, May 1999, pp. 235-244.
    • (1999) Proc. 31th ACM Symp. Theory of Computing (STOC) , pp. 235-244
    • Olshevsky, V.1    Shokrollahi, A.2
  • 25
    • 0033896613 scopus 로고    scopus 로고
    • Efficient decoding of Reed-Solomon codes beyond half the minimum distance
    • Jan.
    • R. M. Roth and G. Ruckenstein, "Efficient decoding of Reed-Solomon codes beyond half the minimum distance," IEEE Trans. Inform. Theory, vol. 46, pp. 246-258, Jan. 2000.
    • (2000) IEEE Trans. Inform. Theory , vol.46 , pp. 246-258
    • Roth, R.M.1    Ruckenstein, G.2
  • 26
    • 0027559038 scopus 로고
    • A new Reed-Solomon decoding algorithm based on Newton's interpolation
    • Mar.
    • U. Sorger, "A new Reed-Solomon 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.1
  • 27
    • 0031097176 scopus 로고    scopus 로고
    • Decoding of Reed-Solomon codes beyond the error correction bound
    • M. Sudan, "Decoding of Reed-Solomon codes beyond the error correction bound," J. Complexity, vol. 12, pp. 180-193, 1997.
    • (1997) J. Complexity , vol.12 , pp. 180-193
    • Sudan, M.1
  • 28
    • 0030672385 scopus 로고    scopus 로고
    • Algorithmic complexity in coding theory and the minimum distance problem
    • El Paso, TX
    • A. Vardy, "Algorithmic complexity in coding theory and the minimum distance problem," in Proc. 29th Symp. Theory of Computing, El Paso, TX, 1997, pp. 92-109.
    • (1997) Proc. 29th Symp. Theory of Computing , pp. 92-109
    • Vardy, A.1
  • 29
    • 0026117536 scopus 로고
    • Bit-level soft-decision decoding of Reed-Solomon codes
    • Mar.
    • A. Vardy and Y. Be'ery, "Bit-level soft-decision decoding of Reed-Solomon codes," IEEE Trans. Commun., vol. 39, pp. 440-445, Mar. 1991.
    • (1991) IEEE Trans. Commun. , vol.39 , pp. 440-445
    • Vardy, A.1    Be'Ery, Y.2
  • 32
    • 0035441838 scopus 로고    scopus 로고
    • Efficient root-finding algorithm with application to list decoding of algebraic-geometric codes
    • Sept.
    • X.-W. Wu and P. H. Siegel, "Efficient root-finding algorithm with application to list decoding of algebraic-geometric codes," IEEE Trans. Inform. Theory, vol. 47, pp. 2579-2587. Sept. 2001.
    • (2001) IEEE Trans. Inform. Theory , vol.47 , pp. 2579-2587
    • Wu, X.-W.1    Siegel, P.H.2


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