Lempel–Ziv complexity
id:
lempel-ziv-complexity-277-16954421
title:
Lempel–Ziv complexity
text:
The Lempel–Ziv complexity is a measure that was first presented in the article On the Complexity of Finite Sequences, by two Israeli computer scientists, Abraham Lempel and Jacob Ziv. This complexity measure is related to Kolmogorov complexity, but the only function it uses is the recursive copy. The underlying mechanism in this complexity measure is the starting point for some algorithms for lossless data compression, like LZ77, LZ78 and LZW. Even though it is based on an elementary principle o
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/Lempel%E2%80%93Ziv_complexity
date created:
date modified:
2024-02-22T20:51:54Z
main entity:
{"identifier":"Q17625095","url":"https://www.wikidata.org/entity/Q17625095"}
image:
fields total:
13
integrity:
13