A new algorithm for efficient exact maximum likelihood decoding of polar codes (which may be CRC augmented), transmitted over the binary erasure channel, is presented. The algorithm applies a matrix triangulation process on a sparse polar code parity check matrix, followed by solving a small size linear system over GF(2). To implement the matrix triangulation, we apply belief propagation decoding type operations. We also indicate how this decoder can be implemented in parallel for low latency decoding. Numerical simulations are used to evaluate the performance and computational complexity of the new algorithm.

翻译：提供了一种通过二进制删除通道传输的极地代码有效精确最大可能的解码新算法(该算法可能是 CRC 增强的) 。 该算法在稀疏的极地代码对等检查矩阵上应用矩阵三角测量程序,然后在 GF(2) 上找到一个小尺寸线性系统。 为了实施矩阵三角测量, 我们应用了信仰传播解码类型操作。 我们还指明了如何在低纬度解码的同时执行该解码器 。 数字模拟用于评估新算法的性能和计算复杂性 。