查看文章

We explore the relationship between polar and RM codes and we describe a coding scheme which improves upon the performance of the standard polar code at practical block lengths. Our starting point is the experimental observation that RM codes have a smaller error probability than polar codes under MAP decoding. This motivates us to introduce a family of codes that “interpolates” between RM and polar codes, call this family , where is the original polar code, and is an RM code. Based on numerical observations, we remark that the error probability under MAP decoding is an increasing function of . MAP decoding has in general exponential complexity, but empirically the performance of polar codes at finite block lengths is boosted by moving along the family even under low-complexity decoding schemes such as, for instance, belief propagation or successive …