title: How do I compute the approximate entropy of a bit string?
body: <p>Is there a standard way to do this?</p>
  
  <p>Googling -- <a href="http://google.com/search?hl=en&amp;q=%22approximate+entropy%22+bits" rel="noreferrer">"approximate entropy" bits</a> -- uncovers multiple academic papers but I'd like to just find a chunk of pseudocode defining the approximate entropy for a given bit string of arbitrary length.</p>
  
  <p>(In case this is easier said than done and it depends on the application, my application involves 16,320 bits of encrypted data (cyphertext).  But encrypted as a puzzle and not meant to be impossible to crack.  I thought I'd first check the entropy but couldn't easily find a good definition of such.  So it seemed like a question that ought to be on StackOverflow! Ideas for where to begin with de-cyphering 16k random-seeming bits are also welcome...)</p>
  
  <p>See also this related question:<br>
  <a href="https://stackoverflow.com/questions/510412/what-is-the-computer-science-definition-of-entropy">What is the computer science definition of entropy?</a></p>