Recursive decoding of Reed-Muller codes

被引：4

作者：

Dumer, I ^{[1
]}

Shabunov, K ^{[1
]}

机构：

[1] Univ Calif Riverside, Coll Engn, Riverside, CA 92521 USA

来源：

2000 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS | 2000年

关键词：

D O I：

10.1109/ISIT.2000.866353

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

We use the Plotkin (u, u+v)-construction for general Reed-Muller codes (m,r) and relegate decoding to the two constituent RM codes. First, we use the better protected code (m-l,r-1) to find a sub-block v, Then we proceed with the block u from the code (m-l,r), We repeat this recursion on both halves and recalculate the reliabilities of the received symbols. In the end, we perform ML decoding on the biorthogonal codes.

引用

页码：63 / 63

页数：1