A modified Guruswami-Sudan algorithm for decoding Reed-Solomon codes

被引:0
|
作者
Wang, Xiaorong [1 ]
Shi, Hongbo [1 ]
机构
[1] Nanjing Univ Finance & Econ, Dept Appl Math, Nanjing 210046, Peoples R China
关键词
Reed-Solomon codes; List decoding algorithm; Design of algorithms; Computational complexity; ALGEBRAIC-GEOMETRY;
D O I
10.1016/j.ipl.2010.08.009
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We tighten a key estimate, which dictates the computational complexity of Guruswami-Sudan algorithm, on the lower bound of the degrees of freedom, and then propose a modified decoding algorithm for Reed-Solomon codes beyond half the minimum distance. The computational complexity of the modified algorithm is lower than the Guruswami-Sudan algorithm for the medium to high rate Reed-Solomon codes, and has the same asymptotic complexity as the algorithm proposed by Wu. Besides we also claim that our modified algorithm outperforms Wu's algorithm to some extent. (C) 2010 Elsevier By. All rights reserved.
引用
收藏
页码:992 / 997
页数:6
相关论文
共 50 条
  • [21] Decoding Reed-Solomon Codes Using Euclid's Algorithm
    Shankar, Prill
    RESONANCE-JOURNAL OF SCIENCE EDUCATION, 2007, 12 (04): : 37 - 51
  • [22] A transform-domain decoding algorithm for Reed-Solomon codes
    Cai, Z. H.
    Hao, J. Z.
    Sun, S. M.
    Chin, P. S.
    Chen, Z. N.
    2006 IEEE INTERNATIONAL CONFERENCE ON ULTRA-WIDEBAND, VOLS 1 AND 2, 2006, : 197 - +
  • [23] Fast Error and Erasure Decoding Algorithm for Reed-Solomon Codes
    Tang, Nianqi
    Chen, Chao
    Han, Yunghsiang S.
    IEEE COMMUNICATIONS LETTERS, 2024, 28 (04) : 759 - 762
  • [24] Hybrid list decoding and Kaneko algorithm of Reed-Solomon codes
    Jin, W.
    Xu, H.
    Takawira, F.
    IEE PROCEEDINGS-COMMUNICATIONS, 2006, 153 (05): : 597 - 602
  • [25] Decoding Reed-Solomon codes using Euclid’s algorithm
    Priti Shankar
    Resonance, 2007, 12 (4) : 37 - 51
  • [26] A modified blahut algorithm for decoding reed-solomon codes beyond half the minimum distance
    Egorov, S
    Markarian, G
    SYMPOTIC'03: JOINT IST WORKSHOP ON MOBILE FUTURE & SYMPOSIUM ON TRENDS IN COMMUNICATIONS, PROCEEDINGS, 2003, : 17 - 20
  • [27] Efficient Interpolation in the Guruswami-Sudan Algorithm
    Trifonov, Peter V.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (09) : 4341 - 4349
  • [28] A modified Blahut algorithm for decoding Reed-Solomon codes beyond half the minimum distance
    Egorov, S
    Markarian, G
    Pickavance, K
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2004, 52 (12) : 2052 - 2056
  • [29] Soft Reed-Solomon decoding for concatenated codes
    Panigrahi, S
    Szczecinski, LL
    Labeau, F
    CCECE 2003: CANADIAN CONFERENCE ON ELECTRICAL AND COMPUTER ENGINEERING, VOLS 1-3, PROCEEDINGS: TOWARD A CARING AND HUMANE TECHNOLOGY, 2003, : 1643 - +
  • [30] Iterative soft decoding of Reed-Solomon codes
    Jiang, J
    Narayanan, KR
    IEEE COMMUNICATIONS LETTERS, 2004, 8 (04) : 244 - 246