Recursive and permutation decoding for Reed-Muller codes

被引：2
|
作者：
Dumer, I [1 ]
Shabunov, K [1 ]
机构：
[1] Univ Calif Riverside, Riverside, CA 92521 USA
来源：
ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS | 2002年
关键词：
D O I：
10.1109/ISIT.2002.1023418
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Two new recursive techniques are described for Reed-Muller (RM) codes and their subcodes. We show that these algorithms yield a substantial asymptotic gain over other nonexponential algorithms known for RM codes. Decoding performance is further enhanced by using intermediate code lists and permutation procedures.
引用
收藏
页码：146 / 146
页数：1
相关论文
共 50 条
  • [31] Distance Threshold Viterbi Decoding of Reed-Muller codes
    Magdy, Ahmed
    Mahran, Ashraf
    Abdel-Hamid, Gamal M.
    [J]. 2019 15TH INTERNATIONAL COMPUTER ENGINEERING CONFERENCE (ICENCO 2019), 2019, : 12 - 16
  • [32] Decoding Reed-Muller Codes With Successive Codeword Permutations
    Doan, Nghia
    Hashemi, Seyyed Ali
    Mondelli, Marco
    Gross, Warren J. J.
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2022, 70 (11) : 7134 - 7145
  • [33] Efficient decoding algorithms for generalized Reed-Muller codes
    Paterson, KG
    Jones, AE
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2000, 48 (08) : 1272 - 1285
  • [34] Reed-Muller Codes
    Abbe, Emmanuel
    Sberlo, Ori
    Shpilka, Amir
    Ye, Min
    [J]. FOUNDATIONS AND TRENDS IN COMMUNICATIONS AND INFORMATION THEORY, 2023, 20 (1-2): : 1 - 156
  • [35] ON THE REED-MULLER CODES
    ASSMUS, EF
    [J]. DISCRETE MATHEMATICS, 1992, 106 : 25 - 33
  • [36] Simplified Decoding of Polar Codes by Identifying Reed-Muller Constituent Codes
    Ghaddar, Nadim
    Saber, Hamid
    Lin, Hsien-Ping
    Bae, Jung Hyun
    Lee, Jungwon
    [J]. 2020 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2020,
  • [37] Efficiently Decoding Reed-Muller Codes from Random Errors
    Saptharishi, Ramprasad
    Shpilka, Amir
    Volk, Ben Lee
    [J]. STOC'16: PROCEEDINGS OF THE 48TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2016, : 227 - 235
  • [38] On Decoding of Reed-Muller Codes Using a Local Graph Search
    Kamenev, Mikhail
    [J]. 2020 IEEE INFORMATION THEORY WORKSHOP (ITW), 2021,
  • [39] Decoding Reed-Muller codes beyond half the minimum distance
    Heydtmann, AE
    Jakobsen, T
    [J]. FINITE FIELDS AND APPLICATIONS, 2001, : 232 - 250
  • [40] On Decoding of Reed-Muller Codes Using a Local Graph Search
    Kamenev, Mikhail
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2022, 70 (02) : 739 - 748
12345