Lempel-Ziv Compression Algorithm: Difference between revisions
From ETHW
(New page: '''''This article is a stub. You can help the GHN by expanding it.''''' Haifa, Israel. Algorithm In 1977, Abraham Lempel and Jacob Ziv develop a highly flexible algorithm that compresses ...) |
No edit summary |
||
| (3 intermediate revisions by 2 users not shown) | |||
| Line 1: | Line 1: | ||
'''''This article is a stub. You can help the GHN by expanding it.''''' | <p>'''''This article is a stub. You can help the GHN by expanding it.''''' </p> | ||
Haifa, Israel. Algorithm In 1977, Abraham Lempel and Jacob Ziv develop a highly flexible algorithm that compresses data with no data loss. | <p>[[Image:Jacob Ziv 2320.jpg|thumb|right|Jacob Ziv]] </p> | ||
<p>Haifa, Israel. Algorithm In 1977, Abraham Lempel and [[Oral-History:Jacob Ziv|Jacob Ziv]] develop a highly flexible algorithm that compresses data with no data loss. First published in the ''IEEE Transactions on Information Theory'' in May 1977 and improved in 1978, it enabled efficient data transmission via the internet.</p> | |||
<p></p> | |||
<p>[[Category:Computers_and_information_processing]] [[Category:Data_systems]] [[Category:Data_compression]]</p> | |||
Revision as of 18:22, 16 September 2010
This article is a stub. You can help the GHN by expanding it.
Haifa, Israel. Algorithm In 1977, Abraham Lempel and Jacob Ziv develop a highly flexible algorithm that compresses data with no data loss. First published in the IEEE Transactions on Information Theory in May 1977 and improved in 1978, it enabled efficient data transmission via the internet.
