Abstract: Lempel-Ziv complexity (LZC) is an algorithm used to quantify the complexity of a data sequence by calculating the number of independent substrings contained in the sequence. LZC succeeds in ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback