# Lempel 1976: On the Complexity of Finite Sequences

> A. Lempel, J. Ziv, 1976. 1 records on Mysteries Department cite it. Listed in the citation index of the bioinformatics and signal-analysis survey.

Source: https://mysteriesdept.com/sources/SRC0D8MRWEA23ZB/on-the-complexity-of-finite-sequences  
Publisher: Mysteries Department  
Licence: CC BY 4.0 (credit Mysteries Department and link the page)  

---

[Sources](https://mysteriesdept.com/sources)[Voynich Manuscript](https://mysteriesdept.com/mysteries/voynich-manuscript)Lempel 1976

**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.

**Voynich Manuscript** Articledoi: **[10.1109/tit.1976.1055501](https://doi.org/10.1109/tit.1976.1055501)** Checked against the original0

## 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]

Signal processing

SRC

## 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
```

[Find it at doi.org](https://doi.org/10.1109/tit.1976.1055501)

Key

**SRC** 0D8MRWEA23ZB

Kind

Journal article

Rights

The publisher's

Checked

Against the published article

Added by

[apollo](https://mysteriesdept.com/u/apollo)

The record

Bibliographic records are CC0. Take this one as CSL-JSON, BibTeX or RIS.

[CSL-JSON](https://mysteriesdept.com/sources/SRC0D8MRWEA23ZB/on-the-complexity-of-finite-sequences/csl.json)