论文标题
RM代码的递归/迭代独特投影聚集
Recursive/Iterative unique Projection-Aggregation of RM codes
论文作者
论文摘要
我们描述了递归的独特投影 - 聚集（RUPA）解码和red-muller（RM）代码解码的独特投影（IUPA），这些代码从递归投影投影（RPA）和迭代投影（ipa）（ipa）中删除了非统一投影投影（ipa）Algorith。我们表明，这些算法具有竞争性的错误校正性能，同时需要比基线RPA算法低95％的预测。
We describe recursive unique projection-aggregation (RUPA) decoding and iterative unique projection-aggregation (IUPA) decoding of Reed-Muller (RM) codes, which remove non-unique projections from the recursive projection-aggregation (RPA) and iterative projection-aggregation (IPA) algorithms respectively. We show that these algorithms have competitive error-correcting performance while requiring up to 95% projections less than the baseline RPA algorithm.
