IEEE Information Theory Workshop (ITW)
An Efficient Block Error Probability Estimation of Reed-Muller Codes under Permutation Decoding
Mikhail Kamenev
Abstract
A method for estimating the block error probability of Reed-Muller codes on a binary erasure channel and a binary symmetric channel under a permutation decoding algorithm is proposed. This method is based on an analysis of the block error probability under a recursive decoding algorithm for a fixed number of input erasures or errors. Simulation results demonstrate that the proposed method allows to effectively predict the block error rate performance of Reed-Muller codes under permutation decoding with a different number of permutations used.