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 条
12345