Tree decoding of BCH codes

被引：0
|
作者：
Univ of Canterbury, Christchurch, New Zealand [1 ]
机构：
来源：
Conf Rec IEEE Global Telecommun Conf | / 3521-3524期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [41] ENCODING AND DECODING OF BCH CODES USING LIGHT AND SHORT CODEWORDS
    ROTH, RM
    SEROUSSI, G
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1988, 34 (03) : 593 - 596
  • [42] New step-by-step decoding for binary BCH codes
    Chr, CL
    Su, SL
    Wu, SW
    2004 9TH IEEE SINGAPORE INTERNATIONAL CONFERENCE ON COMMUNICATION SYSTEMS (ICCS), 2004, : 456 - 460
  • [43] A simple step-by-step decoding of binary BCH codes
    Chr, CL
    Su, SL
    Wu, SW
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2005, E88A (08): : 2236 - 2239
  • [44] NEW ERROR-LOCATING POLYNOMIAL FOR DECODING OF BCH CODES
    DAVIDA, GI
    COWLES, JW
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1975, 21 (02) : 235 - 236
  • [45] Least squares based decoding for BCH codes in image applications
    Rozic, N
    Begusic, D
    Ursic, J
    ICASSP '99: 1999 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, PROCEEDINGS VOLS I-VI, 1999, : 3161 - 3164
  • [46] MAXIMUM-LIKELIHOOD SOFT DECISION DECODING OF BCH CODES
    VARDY, A
    BEERY, Y
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (02) : 546 - 554
  • [47] On algebraic soft-decision decoding algorithms for BCH codes
    Kamiya, N
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (01) : 45 - 58
  • [48] Construction and decoding of BCH codes over chain of commutative rings
    Shah, Tariq
    Qamar, Attiq
    de Andrade, Antonio Aparecido
    MATHEMATICAL SCIENCES, 2012, 6 (01)
  • [49] Soft Decoding, Dual BCH Codes, and Better List-Decodable ε-Biased Codes
    Guruswami, Venkatesan
    Rudra, Atri
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (02) : 705 - 717
  • [50] Soft decoding, dual BCH codes, and better list-decodable ε-biased codes
    Guruswami, Venkatesan
    Rudra, Atri
    TWENTY-THIRD ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2008, : 163 - +
12345