BiEntropy - The Approximate Entropy of a Finite Binary String

📝 Original Info

• Title: BiEntropy - The Approximate Entropy of a Finite Binary String
• ArXiv ID: 1305.0954
• Date: 2013-09-17
• Authors: Researchers from original ArXiv paper

📝 Abstract

We design, implement and test a simple algorithm which computes the approximate entropy of a finite binary string of arbitrary length. The algorithm uses a weighted average of the Shannon Entropies of the string and all but the last binary derivative of the string. We successfully test the algorithm in the fields of Prime Number Theory (where we prove explicitly that the sequence of prime numbers is not periodic), Human Vision, Cryptography, Random Number Generation and Quantitative Finance.

💡 Deep Analysis

Deep Dive into BiEntropy - The Approximate Entropy of a Finite Binary String.

We design, implement and test a simple algorithm which computes the approximate entropy of a finite binary string of arbitrary length. The algorithm uses a weighted average of the Shannon Entropies of the string and all but the last binary derivative of the string. We successfully test the algorithm in the fields of Prime Number Theory (where we prove explicitly that the sequence of prime numbers is not periodic), Human Vision, Cryptography, Random Number Generation and Quantitative Finance.

📄 Full Content

Reference