Please use this identifier to cite or link to this item:
http://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/6620
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Goyal, Megha | - |
dc.contributor.author | Ghrera, S.P [Guided by] | - |
dc.date.accessioned | 2022-09-24T05:45:03Z | - |
dc.date.available | 2022-09-24T05:45:03Z | - |
dc.date.issued | 2017 | - |
dc.identifier.uri | http://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/6620 | - |
dc.description.abstract | Data Compression is a strategy for encoding decides that permits considerable diminishment in the aggregate number of bits to store or transmit a document. Transmission of large quantity of data cost more money. Hence choosing the best data compression algorithm is really important. In addition to different compression technologies and methodologies, selection of a good data compression tool is most important. There is a complete range of different data compression techniques available both online and offline working such that it becomes really difficult to choose which technique serves the best. In this report I represent five algorithms (Arithmetic Coding, LZW, Run-Length Encoding, Deflate and Prediction by Partial Matching) to compress and decompress the text data. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Jaypee University of Information Technology, Solan, H.P. | en_US |
dc.subject | LZW | en_US |
dc.subject | Compression time | en_US |
dc.subject | Future scope | en_US |
dc.title | Implementation of one or more data compression algorithms, analysis of the algorithms and presentation of the results | en_US |
dc.type | Project Report | en_US |
Appears in Collections: | B.Tech. Project Reports |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Implementation of One or More Data Compression Algorithms Analysis of the Algorithms and Presentation of the Results by Megha Goyal.pdf | 1.65 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.