IEEE
You are not logged in, please sign in to edit > Log in / create account  

Lempel-Ziv Compression Algorithm

SHARE |

From GHN

(Difference between revisions)
Jump to: navigation, search
Line 1: Line 1:
 
'''''This article is a stub. You can help the GHN by expanding it.'''''  
 
'''''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. They write a different version in 1978. Makes storage and transmittion of data more efficient.
+
Haifa, Israel. Algorithm In 1977, Abraham Lempel and [[Jacob Ziv Oral History|Jacob Ziv]] develop a highly flexible algorithm that compresses data with no data loss. They write a different version in 1978. Makes storage and transmittion of data more efficient.  
  
[[Category:Computers_and_information_processing]]
+
[[Category:Computers_and_information_processing]] [[Category:Data_systems]] [[Category:Data_compression]]
[[Category:Data_systems]]
+
[[Category:Data_compression]]
+

Revision as of 19:12, 2 February 2009

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. They write a different version in 1978. Makes storage and transmittion of data more efficient.