0
On the Complexity of Finite Sequences
A. Lempel, J. Ziv, 1976. IEEE Transactions on Information Theory.
Defines a measure of the complexity of a finite symbol sequence by how many new phrases are needed to build it by copying from what came before; the idea underlies the later Lempel-Ziv compression algorithms.
What it's used for here
Listed in the citation index of the bioinformatics and signal-analysis survey.
Cited by on this site 1 record
1 methods surveys
SRCSignal processing
Cite it
Lempel, A., & Ziv, J. (1976). On the Complexity of Finite Sequences. IEEE Transactions on Information Theory. https://doi.org/10.1109/tit.1976.1055501
@article{lempel1976on,
author = {Lempel, A. and Ziv, J.},
title = {On the Complexity of Finite Sequences},
journal = {IEEE Transactions on Information Theory},
year = {1976},
doi = {10.1109/tit.1976.1055501},
url = {https://doi.org/10.1109/tit.1976.1055501}
}TY - JOUR TI - On the Complexity of Finite Sequences AU - Lempel, A. AU - Ziv, J. PY - 1976 JO - IEEE Transactions on Information Theory DO - 10.1109/tit.1976.1055501 UR - https://doi.org/10.1109/tit.1976.1055501 ER -
Lempel, A. and J. Ziv. “On the Complexity of Finite Sequences.” IEEE Transactions on Information Theory (1976). https://doi.org/10.1109/tit.1976.1055501.