On recursive decoding with sublinear complexity for Reed-Muller codes

被引：2
|
作者：
Dumer, I [1 ]
机构：
[1] Univ Calif Riverside, Riverside, CA 92521 USA
来源：
2003 IEEE INFORMATION THEORY WORKSHOP, PROCEEDINGS | 2003年
关键词：
D O I：
10.1109/ITW.2003.1216683
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Reed-Muller (RM) codes (m, r) of length 2(m) are considered on a binary symmetric (BS) channel with high crossover error probability 1/2 - epsilon. For an arbitrarily small epsilon > 0, new recursive decoding algorithms are designed that retrieve all information bits of RM codes of fixed order r with a vanishing error probability and sublinear complexity of order O(m(r+1)). The algorithms utilize a vanishing fraction of the received symbols for both hard-and soft-decision decoding.
引用
收藏
页码：14 / 17
页数：4
相关论文
共 50 条
  • [1] Recursive decoding of Reed-Muller codes
    Dumer, I
    Shabunov, K
    [J]. 2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2000, : 63 - 63
  • [2] Recursive and permutation decoding for Reed-Muller codes
    Dumer, I
    Shabunov, K
    [J]. ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, : 146 - 146
  • [3] On polylogarithmic decoding complexity for Reed-Muller codes
    Dumer, I
    [J]. 2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 326 - 326
  • [4] Error exponents for recursive decoding of Reed-Muller codes
    Burnashev, Marat
    Dumer, Ilya
    [J]. 2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, : 704 - +
  • [5] Recursive list decoding for reed-muller codes and their subcodes
    Dumer, I
    Shabunov, K
    [J]. INFORMATION, CODING AND MATHEMATICS, 2002, 687 : 279 - 298
  • [6] Recursive Projection-Aggregation Decoding of Reed-Muller Codes
    Ye, Min
    Abbe, Emmanuel
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (08) : 4948 - 4965
  • [7] Recursive projection-aggregation decoding of Reed-Muller codes
    Ye, Min
    Abbe, Emmanuel
    [J]. 2019 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2019, : 2064 - 2068
  • [8] Soft-decision decoding of Reed-Muller codes: Recursive lists
    Dumer, I
    Shabunov, K
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (03) : 1260 - 1266
  • [9] A hybrid decoding of Reed-Muller codes
    Li, Shuang
    Zhang, Shicheng
    Chen, Zhenxing
    Kang, Seog Geun
    [J]. INTERNATIONAL JOURNAL OF DISTRIBUTED SENSOR NETWORKS, 2017, 13 (02):
  • [10] Reed-Muller codes and permutation decoding
    Key, J. D.
    McDonough, T. P.
    Mavron, V. C.
    [J]. DISCRETE MATHEMATICS, 2010, 310 (22) : 3114 - 3119
12345