
	Where results make sense

Topic: Universal code (data compression)

	DataCompression.info - Source Code (Site not responding. Last check: 2007-10-10)
		Compression algorithms that are illustrated using source code.
		The average compression gain is in the range of 3 to 5 percent for the text files of the Calgary Corpus and between 2 to 9 percent for the text files of the large Canterbury Corpus.
		DCG Framework is a object oriented framework for lossless data compression.
	www.datacompression.info /SourceCode.shtml (8538 words)

	DataCompression.info - Source Code (Site not responding. Last check: 2007-10-10)
		Compression algorithms that are illustrated using source code.
		The decoder is one pass and uses a huffman code table at the beginning of the compressed file to decode the file.
		The average compression gain is in the range of 3 to 5 percent for the text files of the Calgary Corpus and between 2 to 9 percent for the text files of the large Canterbury Corpus.
	datacompression.info /SourceCode.shtml (8512 words)

	LZW Data Compression (Site not responding. Last check: 2007-10-10)
		Data compression has an undeserved reputation for being difficult to master, hard to implement, and tough to maintain.
		Compression occurs when a single code is output instead of a string of characters.
		Since the code for a given string is no longer known merely by its position in the array, we need to store the code for a given string along with the string data.
	www.dogma.net /markn/articles/lzw/lzw.htm (3973 words)

	Data Compression -- Section 3
		3.3 Universal Codes and Representations of the Integers
		While Huffman coding is not applicable unless the probabilities are known, it is sufficient in the case of universal coding to know the probability distribution only to the extent that the source messages can be ranked in probability order.
		The result is an instantaneously decodable code since the total length of a codeword is exactly one greater than twice the number of zeros in the prefix; therefore, as soon as the first 1 of a codeword is encountered, its length is known.
	www.ics.uci.edu /~dan/pubs/DC-Sec3.html (4346 words)

	Universal Product Code (UPC) and EAN Article Numbering Code (EAN)
		A digit is coded as a sequence of two bars and two spaces within a space 7 modules wide.
		The code is smaller because it drops out zeros which would otherwise occur in a symbol.
		The data is enclosed between two left-hand guard bars and three right-hand guard bars.
	www.barcode-1.com /pub/russadam/upccode.html (2121 words)

	No Title
		It is preferable to Huffman coding since one can easily determine a close-to-optimal arithmetic code for coding long strings generated by a discrete memoryless source once the string probabilities are specifed, whereas the Huffman algorithm may not generate an optimal code for source strings of length n in time O(n).
		Although the Elias code encodes at an optimal rate, it is impractical because it requires infinite precision and therefore an infinite buffer size; also, the Elias code is catastropic in the sense that finitely many errors in the code sequence may cause infinitely many errors in the decoded source sequence.
		The well-known universal noiseless source coding technique due to Jacob Ziv and Abraham Lempel was announced in 1977 [26], although the method is based upon a notion of string complexity that had been proposed by these two authors in a paper the year before.
	www.itsoc.org /review/kieffer.html (1970 words)

	Lossless Data Compression
		The design of the Huffman code is optimal (for a fixed blocklength) assuming that the source statistics are known a priori.
		The basic idea in Huffman coding is to assign short codewords to those input blocks with high probabilities and long codewords to those with low probabilities.
		A code tree is thus generated and the Huffman code is obtained from the labeling of the code tree.
	www.data-compression.com /lossless.html (932 words)

	Universal Product Code (UPC) and EAN Article Numbering Code (EAN)
		A digit is coded as a sequence of two bars and two spaces within a space 7 modules wide.
		The code is smaller because it drops out zeros which would otherwise occur in a symbol.
		Uniform Code Council has a home page that provides a catalog of information they sell and an electronic version of their newsletter.
	www.adams1.com /pub/russadam/upccode.html (2090 words)

	Entropy encoding -
		An entropy encoding is a coding scheme that assigns codes to symbols so as to match code lengths with the probabilities of the symbols.
		Typically, entropy encoders are used to compress data by replacing symbols represented by equal-length codes with symbols represented by codes proportional to the negative logarithm of the probability.
		If the approximate entropy characteristics of a data stream are known in advance (especially for signal compression), a simpler static code such as unary coding, Elias gamma coding, Fibonacci coding, Golomb coding, or Rice coding may be useful.
	psychcentral.com /psypsych/Entropy_code (271 words)

	Lossless Data Compression Program: Hybrid LZ77 RLE
		It may be advantageous to compress a string as two shorter matches instead of one long match and a bunch of literal bytes, and it can be better to compress a string as a literal byte and a long match instead of two shorter matches.
		Some other data compression algorithms use a value (using variable-length code) that indicates the number of literal bytes that follow, but this is really analogous to a prefix bit, because 1-byte uncompressed data is very common for modestly compressible files.
		This code also copies the compressed data forward in memory so that it won't be overwritten by the decompressed data before we have had a change to read it.
	www.cs.tut.fi /~albert/Dev/pucrunch (13324 words)

	Guide to FM-94 BUFR (Chapters 1-3) (Site not responding. Last check: 2007-10-10)
		The data may be numeric as in the case of a WMO block number, character data as in the case of an aircraft identifier.
		The units may also refer to a code or flag table, where the code or flag table is described in the WMO Manual On Codes using as the code or flag table number the same number as the F X Y descriptor.
		If a data processing center had multiple sources of data receipt, for example, it may be necessary to indicate the source of an observation by the circuit from which the data was received.
	www.wmo.ch /web/www/WDM/Guides/Guide-binary-1A.html (6410 words)

	Cisco AS5400 Series Universal Gateway Data Sheet [Cisco AS5400 Series Universal Gateways] - Cisco Systems
		The Cisco AS5400 Series Universal Gateways introduce minimal delay as voice data is received from the PSTN and transmitted to the IP network for G.711 calls.
		Combined with greater compression and connection speeds, V.92 and V.44 allow service providers to offer their subscribers a "broadband-lite" experience, which enables Internet users to experience the qualities usually associated with broadband for the price of dialup or modem access.
		Universal access (analog modem or digital calls) is supported when an interface is configured for ISDN PRI signaling; PRI signaling is available for both T1 and E1 trunks.
	www.cisco.com /en/US/products/hw/univgate/ps505/products_data_sheet09186a0080091e51.html (6529 words)

	DataCompression.info - Huffman Coding (Site not responding. Last check: 2007-10-10)
		The ease with which Huffman codes can be created and used makes this still an extremely popular tool for compression code.
		Compression is based on Burrows Wheeler Transformation and modified Huffman entropy coder.
		The compression ratio is in par with most of the commercial grade compression utilities.
	datacompression.info /Huffman.shtml (3319 words)

	The PAQ Data Compression Programs
		PAQ is a series of open source data compression archivers that have evolved through collaborative development to top rankings on several benchmarks measuring compression ratio (although at the expense of speed and memory usage).
		Compressed size for the concatenated corpus is always about 150-200 bytes smaller (due solely to the archive header), and compression time is about the same.
		Instead, the compression option stored in the archive is used, which means that the decompressor needs the same amount of memory as was used to compress the files.
	www.cs.fit.edu /~mmahoney/compression (5971 words)

	LZ77 Data Compression
		Modern methods of data compression all go back to J. ZIV and A. In 1977 they published a paper in an engineering journal on a new approach to data compresson.
		LZ77-based schemes keep track of the last n bytes of data seen, and when a phrase is encountered that has already been seen, they output a pair of values corresponding to the position of the phrase in the previously-seen buffer of data, and the length of the phrase.
		In effect the compressor moves a fixed-size "window" over the data (generally referred to as a "sliding window" [or "ring buffer"], with the position part of the (position, length) pair referring to the position of the phrase within the window.
	home.earthlink.net /~neilbawd/pall.html (1265 words)

	Universal Source Encoding for Science Data (USES) Lossless Data Compression Technique (Site not responding. Last check: 2007-10-10)
		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)

	Glossary
		CD writer, referring to the way data is recorded, using a laser beam to change the optical properties of chemicals sandwiched between the layers of a recordable disc
		The current norm is around 0.28mm, higher performance CRTs have dot pitches of between 0.23 and 0.25mmtransferred from the hard disc to the RAM memory chips.
		Encryption or scrambling renders files unreadable by any conventional means without the correct decryption software and a unique 'key' code, which is needed to unlock the data.
	www.rickmaybury.com /links.html (2971 words)

	Mitsuharu ARIMURA's Bookmarks on Source Coding/Data Compression
		IEEE Data Compression Conference, Snowbird, Utah, March 1997.
		Charles Bloom, "LZP: a new data compression algorithm," Proc.
		Marcelo J. Weinberger and Gadiel Seroussi, "Sequential Prediction and Ranking in Universal Context Modeling and Data Compression," HP Labs Technical Reports, HPL-94-111, Jan. 1997.
	www.hn.is.uec.ac.jp /~arimura/compression_links.html (996 words)

	"Digital Broadcast \| Vendor News Asia "
		Customers have confirmed bit-rates 20 to 30 percent lower than any currently deployed HD H.264 encoder, and the system has already been selected by five satellite and telco operators in North America and Europe to power their forthcoming HD services.
		Marketing is directed to you if you are in satellite, telco/IPTV and cable operators, applications where the Electra 7000 sets a radically improved benchmark for HD H.264 compression performance and video quality.
		It provides a wide range of enhancements to the object carousel, data and signalling generator as well as to TSPlayer MPEG-2 transport stream generator.
	e-broadcastnewsasia.blogspot.com /2006_07_01_e-broadcastnewsasia_archive.html (4966 words)

	DCC Home Page (Site not responding. Last check: 2007-10-10)
		An international forum for current work on data compression for text, images, video, audio, and related areas.
		Be sure to specify that your are with the Data Compression Conference (DCC) to insure that you get the conference room rate.
		The winner of the award is voted by the DCC program committee, notified during the year following the conference, and formally announced in the following year's DCC proceedings.
	www.cs.brandeis.edu /~dcc (1763 words)

	Library: A.M.L. Source Code - Advanced Media Library.; HS XMODEM C Source Library 1.1.
		HS XMODEM is a software library in C (supplied with full source code) that provides a programmer with the off-the-shelf support for XMODEM protocol data transfer capability.
		With CodeVista, programmers can store and organize snippets of code, whole classes or even complete program installation kits as well as any other type of files together with rich text formatted notes and descriptions, Internet links and much more.
		compression library, basic, network, video, protocol module, winsock, components, small library, visual, file
	www.soft411.com /software/library_2.html (588 words)

	Shareware Connection: Freeware, Shareware and Demo Software Downloads
		Browse electrical and electronics companies categorized by country.
		Featuring state-of-the-art technology and an intuitive interface, this powerful software will protect you from data disasters and make the entire backup process effortless and quick., in
		A set of 50 challenging puzzles of increasing difficulty.
	www.sharewareconnection.com (357 words)

	MoQvo: Digital Life TV. Digital Life TV content, Digital Life TV audio, Digital Life TV video clips, Digital Life TV ...
		Episode 96: Robert reports on CEDIA, iTunes 7: Performance issues, Universal Back Out of Bluray.
		When are 16:9 videos really 4:3, Laptop coolers, Reviving a bad drive format.
		Holographic data drive technologies, Cheap Web Hosting Reccos from the DL.TV Crew and much more.
	www.moqvo.com /en/articles/digital_life_tv_channel_630.html (3196 words)

	Universal Thread
		Conference on Data System Languages (Group that designed COBOL)
		Database File (also a table that roughly conforms to the xBase style)
		Software Defined Network [AT&T] Secure Data Network Service
	www.universalthread.com /Accr.asp (355 words)

Try your search on: Qwika (all wikis)