A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is
Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)
A new measure of string complexity  for finite strings is presented based on a specific recursive hierarchical string production process (c. f.  ). From the maximal bound we deduce a relationship between complexity and total information content.doi:10.1109/isit.1998.708931 fatcat:ng6qxbgconecjmfhin6nlxfgai