Permutation Entropy for Random Binary Sequences
AbstractIn this paper, we generalize the permutation entropy (PE) measure to binary sequences, which is based on Shannon’s entropy, and theoretically analyze this measure for random binary sequences. We deduce the theoretical value of PE for random binary sequences, which can be used to measure the randomness of binary sequences. We also reveal the relationship between this PE measure with other randomness measures, such as Shannon’s entropy and Lempel–Ziv complexity. The results show that PE is consistent with these two measures. Furthermore, we use PE as one of the randomness measures to evaluate the randomness of chaotic binary sequences. View Full-Text
Share & Cite This Article
Liu, L.; Miao, S.; Cheng, M.; Gao, X. Permutation Entropy for Random Binary Sequences. Entropy 2015, 17, 8207-8216.
Liu L, Miao S, Cheng M, Gao X. Permutation Entropy for Random Binary Sequences. Entropy. 2015; 17(12):8207-8216.Chicago/Turabian Style
Liu, Lingfeng; Miao, Suoxia; Cheng, Mengfan; Gao, Xiaojing. 2015. "Permutation Entropy for Random Binary Sequences." Entropy 17, no. 12: 8207-8216.