Quantum Information Theory is about studying information encoded in quantum systems and exploring their unique properties. The topic of our report is Quantum Data Compression, a central problem to storage and transmission of data. Our report presents an overview of Classical Coding Theory and the main concepts of Quantum Coding Theory. Moreover, we introduce a particular quantum noiseless and l...

Linked data has experienced accelerated growth in recent years. With the continuing proliferation of structured data, demand for RDF compression is becoming increasingly important. In this study, we introduce a novel lossless compression technique for RDF datasets, called Rule Based Compression (RB Compression) that compresses datasets by generating a set of new logical rules from the dataset a...

In this article we advance the conjecture that conscious awareness is equivalent to data compression. Algorithmic information theory supports the assertion that all forms of understanding are contingent on compression (Chaitin, 2007). Here, we argue that the experience people refer to as consciousness is the particular form of understanding that the brain provides. We therefore propose that the...

This paper first explores the history of the Digital Video MPEG Standards as created by the MPEG Committee of the International Standards Organization(ISO) for data compression. Included are existing standards, i.e. MPEG-1,2,4, and 7. Additionaly, recent developments to the MPEG-21 standard that is still in production will be looked at. For each of the standards, a brief overview of the standar...

This paper describes cryptographic methods for concealing information during data compression processes. These include novel approaches of adding pseudo random shuffles into the processes of dictionary coding (Lampel-Ziv compression), arithmetic coding, and Huffman coding. An immediate application of using these methods to provide multimedia security is proposed.

Parallel computing allows software to run faster by using multiple processors and performing multiple computations simultaneously when possible. The majority of general purpose software is designed for sequential machines and does not take advantage of parallel computing. Lossless data compression software like WinZip, gzip, and bzip2, used for compressing any files found on a computer, are des...

This correspondence presents entropy analyses for dithered and undithered quantized sources. Two methods are discussed that reduce the increase in entropy caused by the dither. The first method supplies the dither to the lossless encoding-decoding scheme. It is argued that this increases the complexity of the encoding-decoding scheme. A method to reduce this complexity is proposed. The second m...

This thesis makes several contributions to the field of data compression. Lossless data compression algorithms shorten the description of input objects, such as sequences of text, in a way that allows perfect recovery of the original object. Such algorithms exploit the fact that input objects are not uniformly distributed: by allocating shorter descriptions to more probable objects and longer d...

3 Probability Coding 10 3.1 Prefix Codes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10 3.1.1 Relationship to Entropy . . . . . . . . . . . . . . . . . . . . . . . . . . . 11 3.2 Huffman Codes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 13 3.2.1 Combining Messages . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 15 3.2.2 Minim...

A new approach to data compression is developed and applied to multimedia content. This method separates messages into components suitable for both lossless coding and ’lossy’ or statistical coding techniques, compressing complex objects by separately encoding signals and noise. This is demonstrated by compressing the most significant bits of data exactly, since they are typically redundant and...