This repository has been archived by the owner on Jul 6, 2021. It is now read-only.
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
Showing
2 changed files
with
67 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,67 @@ | ||
##################################################################### | ||
Ravdec- LossLess Data Compression | ||
Algorithm Designer, and Module Developer: Mr. Ravin Kumar | ||
Email : mr.ravin_kumar@hotmail.com | ||
linkedin : https://in.linkedin.com/in/ravinkumar21 | ||
##################################################################### | ||
Ravdec is a module written in python, which is based on a Lossless Data Compression Algorithm designed by Mr.Ravin Kumar on | ||
19 September, 2016.This compression algorithm have a fixed compression ratio of 1.1429 in all possible cases, It accepts data | ||
of following format: alphabets,numbers, and symbols. | ||
Example: It can compress 1 GB to 896 MB. | ||
|
||
=======Application of Ravdec ========= | ||
|
||
It can be used where the machine generates data at a very fast rate, that it became difficult for other algorithms to calculate | ||
the propability of a symbol, as data keeps on getting large, and is transmitted over the network with a much faster rate. In | ||
this case also, the above module, and algorithm gives the same compression ratio. | ||
|
||
=======Application of Ravdec ========= | ||
|
||
NOTE- The data that is to be compressed should have length of multiple of 8.(i.e 8 elements, or 16 | ||
elemnts or 24...so on) | ||
|
||
1) file_compression(filename) : | ||
It is used to read data from a file, and create a compressed file wit extention of ".rav" | ||
|
||
2) file_decompression(filename) | ||
It is used to read data from a previously compressed file, and create a decompressed file wit extention of ".dec" | ||
|
||
|
||
Example: | ||
------------------------------ | ||
import ravdec | ||
|
||
# to compress the file have elements of multiple of 8. | ||
ravdec.file_compression("filename.txt") | ||
|
||
# to decompress the previously compressed file. | ||
ravdec.file_decompression("filename.rav") | ||
|
||
------------------------------ | ||
|
||
3) net_compression("data to be compressed of length of multiple of 8 ") - To compress the original data to transmit, that is | ||
needed to be transmitted. | ||
4) net_decompression(" previously compressed data") - To decompress the previously compressed data, that is received. | ||
|
||
It is used where the machine generates data at a very fast rate, that it became difficult for other algorithms to calculate the | ||
propability of a symbol, as data keeps on getting large, and is transmitted over the network with a much faster rate. | ||
|
||
Example: | ||
------------------------------ | ||
import ravdec | ||
|
||
# for compression | ||
compressed_data=ravdec.net_compression("ASDFGHJK") | ||
|
||
# note- data to be compressed should have length of multiple of 8.(i.e 8 elements, or 16 elemnts or 24...so on) | ||
# for decompression | ||
|
||
decompressed_data=ravdec.decompression("previously compressed data") | ||
|
||
------------------------------ | ||
|
||
This module is a freeware, build with the intention to help communities in data compression aspects. | ||
->Application of this module: | ||
It can be used where the machine generates data at a very fast rate, that it became difficult for other algorithms to | ||
calculate the propability of a symbol, as data keeps on getting large, and is transmitted over the network with a much faster | ||
rate. In this case also, the above module, and algorithm gives the same compression ratio. |
Binary file not shown.