
	Where results make sense

Topic: Lossless data compression

Related Topics

data compression

Data East

Data Encryption Standard

data mining

tree data structure

Protein data bank

data transmission

data processing

data types

abstract data types

lossy data compression

In the News (Wed 22 May 13)

EXECUTIVE POWER

Iran

ANALYSIS

Pakistan

Family compact

	Lossless data compression - Wikipedia, the free encyclopedia
		Lossless data compression is a class of data compression algorithms that allows the exact original data to be reconstructed from the compressed data.
		Lossless data compression is used in software compression tools such as the highly popular ZIP file format, used by PKZIP, WinZip, and Mac OS X, and the Unix programs bzip2, gzip and compress.
		Lossless compression is used when it is important that the original and the decompressed data be identical, or when no assumption can be made on whether certain deviation is uncritical.
	en.wikipedia.org /wiki/Lossless_data_compression (1197 words)

	Data compression - Wikipedia, the free encyclopedia
		One popular instance of compression that many computer users are familiar with is the ZIP file format, which, as well as providing compression, acts as an archiver, storing many files in a single output file.
		In practice lossy data compression will also come to a point where compressing again does not work, although an extremely lossy algorithm, which for example always removes the last byte of a file, will always compress a file up to the point where it is empty.
		One very simple means of compression, for example, is run-length encoding, wherein large runs of consecutive identical data values are replaced by a simple code with the data value and length of the run.
	en.wikipedia.org /wiki/Data_compression (1386 words)

	[1.0] Introduction / Lossless Data Compression (Site not responding. Last check: 2007-10-07)
		Lossless data compression is used when the data has to be uncompressed exactly as it was before compression.
		Lossless compression ratios are generally in the range of 2:1 to 8:1.
		Data compression literature also often refers to data compression as data "encoding", and of course that means data decompression is often called "decoding".
	www.vectorsite.net /ttdcmp1.html (5166 words)

	Theory of Data Compression
		Lossless data compression theory and rate-distortion theory are known collectively as source coding theory.
		Compression rate is the rate of the compressed data (which we imagined to be transmitted in ``real-time'').
		Compression ratio is the ratio of the size or rate of the original data to the size or rate of the compressed data.
	www.data-compression.com /theory.html (2876 words)

	Lossless Wavelet Compression
		Lossless compression algorithms are used to compress data where loss cannot be tolerated.
		If there was no noise in the deterministic data the magic compression algorithm could compress the data set to a small set of values, consisting of the initial starting state and the length of the data set to be generated.
		A lossy compression algorithm might be appropriate for the image compression used for Web page images, but it would be totally unacceptable for compressing the data from a chemistry experiment or a financial time series.
	www.bearcave.com /misl/misl_tech/wavelets/compression (3163 words)

	Lossless data compression with low complexity (US6043763)
		A number of samples are repeatedly compressed using different adaptation rates, and the adaptation rate which produces the best compression results is used.
		compressing the samples of the signal using the adaptive predictor in accordance with the adaptation rate as adjusted to form a second compressed signal;
		Data compression using adaptive bit allocation and hybrid lossless entropy encoding
	www.delphion.com /details?pn=US06043763__ (506 words)

	Maximum Compression (lossless data compression software)
		Maximum Compression's goal is to show the maximum achievable compression ratio for several filetypes (text, executable etc).
		THOR 0.3a and QazaR both have better compression while THOR, written in Delphi(!), is also faster then previous version; it now clocks a compression speed of almost 43 MB/s in MFC test.
		In the multiple file compression section there now is a ranking based on efficiency of the compressors (please note there is still a lot of work to do here, like testing other programs, improving layout etc...).
	www.maximumcompression.com (4413 words)

	DataCompression.info - Lossless Compression (Site not responding. Last check: 2007-10-07)
		This category covers lossless compression methods that can't be pinned down to one of the more refined topics, such as LZW or Zip.
		CODEC uses proprietary lossless compression, and is ported to a wide variety of platforms.
		Like other lossless compression schemes the data reduction varies with the source, but it is generally between 25% and 50% for typical popular music and somewhat better than that for classical music and other sources with greater dynamic range.
	datacompression.info /Lossless.shtml (7111 words)

	Lossless Data Compression
		The main objective of this page is to introduce two important lossless compression algorithms: Huffman Coding and Lempel-Ziv Coding.
		This is because the length of the input data in the example is too short.
		In practice, the Lempel-Ziv algorithm works well (lead to actual compression) only when the input data is sufficiently large and there are sufficient redundancy in the data.
	www.data-compression.com /lossless.html (932 words)

	ITinfo: Lossless Data Compression
		ZeoSync Corp., based in West Palm Beach, Florida is a scientific research company that yesterday announced that it has been able to compress data in a way that ensures there is no loss of fidelity without removing redundant data.
		Lossless data compression is the process by which digital information is compacted, stored and then restored to its original format without losing or changing the information.
		Around the office, we test each new compression tool that becomes readily available for two attributes: 1) a greater lossless compression ratio and 2) speed and efficiency of use.
	www.dgl.com /itinfo/2002/it020109.html (400 words)

	CS590N/ECE501L: Lossless Data Compression (Site not responding. Last check: 2007-10-07)
		The first one is to analyze and compress (encode) any given file, and the second one is to decompress (decode) the compressed output of the first so as to recover the original file.
		The purpose of this project is limited in that you are not expected to spend too much effort on such modeling and implementation issues, but on correct encoding and decoding with your method of choice.
		The report is to also contain compression results obtained on files of different types and sizes, as well as a discussion of these results.
	www.cstp.umkc.edu /~oguzn/cs590n/ws04/project/projb.html (448 words)

	Energy Aware Lossless Data Compression - BARR, ASANOVIC (ResearchIndex) (Site not responding. Last check: 2007-10-07)
		If the energy required to compress data is less than the energy required to send it, there is a net energy savings and consequently, a longer battery life for portable computers.
		97 Introduction to data compression (context) - Sayood - 2002 ACM
		14 A unified header compression framework for low-bandwidth lin..
	citeseer.ist.psu.edu /584313.html (654 words)

	The Art Of Lossless Data Compression (Site not responding. Last check: 2007-10-07)
		Here are the results of tests performed in August 2002 to compare lossless compression of "plain" texts by all known good enough programs developed for such purpose, including UHArc, PPMd, Bzip2, RAR, ACE and 7-zip.
		Compression time is divided by 10 here, because more than 90% of people would never compress anything during their life (with compression programs), but they use compressed data almost _every_ time they use computers and/or Internet.
		That's why compression time is not so actual for them.
	www.compression.ru /artest/texts25.html (238 words)

	Lossless data compression with low complexity (US6125348)
		The accuracy of the linear predictor is improved by including, in the prediction of a current sample of a first channel of the digitized signal, look-ahead sample data from a corresponding second channel of the digitized signal.
		Since correlated channels of a digitized signal have a relatively high degree of correlation, accuracy of sample prediction is improved and residuals between the predicted samples and actual samples are reduced, thereby reducing the amount of data required to represent the residuals.
		In reconstructing the encoded samples, a decoder uses a current reconstructed sample of the first channel of a digitized signal to predict a current sample of the second corresponding channel.
	www.delphion.com /details?pn=US06125348__ (547 words)

	Adaptive Lossless Data Compression (ALDC) (Site not responding. Last check: 2007-10-07)
		The ALDC (Adaptive Lossless Data Compression) algorithm is one variant of the LZ1 (Lempel-Ziv 1) class of data compression algorithms, first proposed by Abraham Lempel and Jacob Ziv in 1977.
		The encoder does this using the input data it receives for compression, while the decoder generates an identical data stream as its output, which it also uses for the update process.
		ALDC is a lossless algorithm, insuring that the decompressed data output is exactly the same as the uncompressed data input.
	www.aha.com /show_prod_type.php?id=4 (235 words)

	Data Compression
		This is a twelve-part course on lossless data compression.
		For example, this was written before gzip and the "deflate" algorithm existed, at a time when "freeze" was being explored as a replacement for the UNIX "compress" command.
		For anyone intrigued by the "stackable" compression modules described in lesson 12, I have made the complete source code to HardPressed available on this site.
	www.fadden.com /techmisc/hdc (306 words)

	Lossless Data Compression
		Reducing data size and transmission time are the key benefits of AHA's line of lossless data compression integrated circuits and boards.
		Used primarily in data storage, AHA offers a complete family of ALDC integrated circuits based on the LZ1 (Lempel-Ziv 1) class of data compression algorithms.
		Capable of simultaneous compression and decompression, with speeds ranging from 16 to 66 Mbytes/second, AHA's premier lossless data compression products are based on proprietary algorithms developed specifically to optimize bit-mapped data in memory intensive applications.
	www.aha.com /show_tech.php?id=1 (319 words)

	Open Directory - Computers: Software: Data Compression (Site not responding. Last check: 2007-10-07)
		Maximum Compression - Aims to show the maximum achievable compression ratio for several filetypes (text, executable).
		USENET Compression FAQ - This URL takes you to a compression FAQ that explains compression to technical people as well as describing the various programs, and what they do to users.
		Zzip compression algorithm is mainly based on the Burrows-Wheeler Transform method developped by Mike Burrows and David Wheeler.
	dmoz.org /Computers/Software/Data_Compression (927 words)

	MobiSys '03 Technical Program - Abstract
		We show that with several typical compression tools, there is a net energy increase when compression is applied before transmission.
		We also explore the fact that, for many usage models, compression and decompression need not be performed by the same algorithm.
		Compared with a system using a single optimized application for both compression and decompression, the asymmetric scheme saves 11% or 12% of the total energy depending on the dataset.
	www.usenix.org /events/mobisys03/tech/barr.html (299 words)

	Universal Source Encoding for Science Data (USES) Lossless Data Compression Technique (Site not responding. Last check: 2007-10-07)
		Universal Source Encoding for Science Data (USES), originally developed as Universal Source Encoding for Space (aka, USES), is a lossless data compression technique best suited for science data of various instruments.
		It compresses science data into smaller volume and after decompression (decoding) is applied, the reconstructed data is EXACTLY the original data, no distortion of even one single bit is incurred in the whole process.
		It was later fully analyzed and enhanced by a research group at Goddard Space Flight Center in the late 80's and early 90's.
	gcmd.gsfc.nasa.gov /records/01-uses-01.html (350 words)

	Lossless Data Compression, Fall 2005
		Peter Bro Miltersen, Course Notes for Data Compression, 1, 2.
		A daimi newsgroup: daimi.ldc has been set up for discussions related to the course and the second quarter course "Lossy Data Compression".
		Presentation of the ldc object oriented java framework for data compression.
	www.daimi.au.dk /~bromille/DC05/lossless.html (262 words)

	EDN: Lossless data-compression IC packs variable sectors: hardwired algorithm linked to 8-bit microprocessor ... (Site not responding. Last check: 2007-10-07)
		Lossless data-compression IC packs variable sectors: hardwired algorithm linked to 8-bit microprocessor interface.(InfoChip Systems' IC-105 coprocessor.) (product announcement)
		InfoChip Systems Inc introduces a lossless data and image compression chip, the IC-105, for which the firm claims compression rates of from 4:1 to 15:1 for CCITT Group 3 documents, 3:1 to 8:1 for databases, 1.5:1 to 7:1 on image files, and up to 2:1 on executable code.
		The embedded algorithm is essentially a reduced Markov coding model, treating packets as sectors, removing redundancy to improve disk capacity and automatically passing through uncompressible data.
	www.highbeam.com /library/doc0.asp?docid=1G1:8437472&refid=ink_tptd_mag (224 words)

	Lossless Data Compression (ResearchIndex) (Site not responding. Last check: 2007-10-07)
		If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
		Abstract: This document has been approved for publication by the Management Council of the Consultative Committee for Space Data Systems (CCSDS) and represents the consensus technical agreement of the participating CCSDS Member Agencies.
		The procedure for review and authorization of CCSDS Recommendations is detailed in the Procedures Manual for the Consultative Committee for Space Data Systems (reference [B1]), and the record of Agency participation in the authorization of this document can be obtained...
	citeseer.ist.psu.edu /275008.html (247 words)

	The Art Of Lossless Data Compression, theory&practice, past,present&future
		The Green Tree Of Compression Methods - A Practical Introduction To Data Compression
		Compression of Multimedia Information (Introduction, Part II) version 1.0, March 2001
		Find artest24.zip and eri51fre.zip with ftpsearch.lycos.com, find "Art Of Lossless Data Compression" with NorthernLight, Yahoo, AltaVista or Excite
	go.to /artest - http://www.compression.ru/artest/index_e.html (146 words)

	The Art Of Lossless Data Compression - theory & practice - past, present & future
		The Art Of Lossless Data Compression - theory & practice - past, present & future - http://go.to/artest
		Find artest19.zip and eri45fre.zip with ftpsearch.lycos.com, find "Art Of Lossless Data Compression" with NorthernLight, Yahoo, AltaVista or Excite
		References to this site are on the Compression Pointers Page, in the comp.compression FAQ, Open Directory and The Data Compression Library
	go.to /artest - http://geocities.com/SiliconValley/Bay/1995 (165 words)

	PCMag.com Shareware Library: The Art Of Lossless Data Compression 22
		PCMag.com Shareware Library: The Art Of Lossless Data Compression 22
		Home > Downloads > Shareware Library > Utilities/Drivers/System Files › Archiving and compressing programs › The Art Of Lossless Data Compression 22
		PC Magazine is a registered trademark of Ziff Davis Publishing Holdings Inc. Reproduction in whole or in part in any form or medium without express written permission of Ziff Davis Media Inc. is prohibited.
	shareware.pcmag.com /product.php[id]54365[cid]13[SiteID]pcmag (148 words)

Try your search on: Qwika (all wikis)