Complexity measures for cryptographic sequences

Maximum order complexity, which is a generalization of linear complexity, is discussed. An efficient algorithm with linear time and memory requirements is available for its calculation. The Lempel-Ziv complexity measure forms the basis of a very efficient universal source coding algorithm. The relationship between these two complexity measures is discussed.<
>