Performance of Reed-Muller codes and a maximum-likelihood decoding algorithm for OFDM

被引：0
|
作者：
Hewlett-Packard Laboratories, Bristol BS126QZ, United Kingdom [1 ]
机构：
来源：
IEEE Trans Commun | / 7卷 / 949-952期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
12
引用
收藏
相关论文
共 50 条
  • [41] ON THE REED-MULLER CODES
    ASSMUS, EF
    DISCRETE MATHEMATICS, 1992, 106 : 25 - 33
  • [42] Maximum-Likelihood Decoding of Reed-Solomon Codes is NP-hard
    Guruswami, Venkatesan
    Vardy, Alexander
    PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 470 - 478
  • [43] Maximum-likelihood decoding of Reed-Solomon codes is NP-hard
    Guruswami, V
    Vardy, A
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (07) : 2249 - 2256
  • [44] A performance comparison of polar codes and reed-muller codes
    Arikan, Erdal
    IEEE COMMUNICATIONS LETTERS, 2008, 12 (06) : 447 - 449
  • [45] Recursive decoding and its performance for low-rate Reed-Muller codes
    Dumer, I
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (05) : 811 - 823
  • [46] Simplified Decoding of Polar Codes by Identifying Reed-Muller Constituent Codes
    Ghaddar, Nadim
    Saber, Hamid
    Lin, Hsien-Ping
    Bae, Jung Hyun
    Lee, Jungwon
    2020 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2020,
  • [47] Maximum likelihood decoding of reed solomon codes
    Sudan, M
    37TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 1996, : 164 - 172
  • [48] Maximum likelihood decoding of Reed Solomon codes
    Ponnampalam, V
    Vucetic, B
    1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 1998, : 368 - 368
  • [49] Efficiently Decoding Reed-Muller Codes from Random Errors
    Saptharishi, Ramprasad
    Shpilka, Amir
    Volk, Ben Lee
    STOC'16: PROCEEDINGS OF THE 48TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2016, : 227 - 235
  • [50] On Decoding of Reed-Muller Codes Using a Local Graph Search
    Kamenev, Mikhail
    2020 IEEE INFORMATION THEORY WORKSHOP (ITW), 2021,
12345