A Ranking Method for Rating the Performances of Permutation Codes

Abstract

Minimum Hamming distance, d m , has been widely used as the yardstick for the performance of permutation codes (PCs). However, a number of PCs with the same d m and cardinality can have different performances, even if they have the same distance optimality. Since PC is a robust channel coding scheme in power line communications applications, we present a simple and fast ranking method that predicts the relative performance of PCs, by using the information extracted from their Hamming distance distributions. This tool is useful for selecting an efficient PC codebook out of a number of similar ones.