Click here to Skip to main content
12,512,130 members (52,724 online)
Rate this:
 
Please Sign up or sign in to vote.
See more: C++ C Algorithms
Hi,
I want to implement LZMA (Lempel–Ziv–Markov chain algorithm) alogrithm. for both compression and decompression.But I couldn't find any documentation for that.
Can any one tell me the working of LZMA? or is there any documentation for the same which can describe working of it in detail?
Posted 29-Mar-12 23:33pm
Aby321571
Comments
Member 10810608 5-Feb-16 10:08am
   
Have you find something interresting

1 solution

Rate this: bad
 
good
Please Sign up or sign in to vote.

Solution 1

Have you checked out the LZMA SDK[^] page?


[update]
The Salomon's "Data Compression: The Complete Reference" book should have a description. At least according to the author himself[^].
[/update]
  Permalink  
v2
Comments
Shinde Ajay B 30-Mar-12 6:07am
   
I have checked LZMA SDK but it has no documentation.
and though it is open source, it is so complicated and confusing.
For only only algorithm can also do.
Thanks.
Stefan_Lang 8-Feb-16 9:16am
   
It's advanced mathematics, of course it's complicated! If you want to understand the algorithm, better check the math library at your nearest university. For internet research, you could start at wikipedia and follow the references there:
https://en.wikipedia.org/wiki/Lempel%E2%80%93Ziv%E2%80%93Markov_chain_algorithm

[edit]just noticed the time stamp on this QA - sorry for the late comment ;-) [/edit]

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

  Print Answers RSS
Top Experts
Last 24hrsThis month


Advertise | Privacy | Mobile
Web02 | 2.8.160929.1 | Last Updated 5 Feb 2016
Copyright © CodeProject, 1999-2016
All Rights Reserved. Terms of Service
Layout: fixed | fluid

CodeProject, 503-250 Ferrand Drive Toronto Ontario, M3C 3G8 Canada +1 416-849-8900 x 100