In this paper we describe a lossless coding scheme for the encoding of MPEG-1 Layer III encoded audio bitstreams. Commonly known as MP3, the MPEG-1 Layer III standard has proved widely popular for the transmission of encoded audio les (MP3's) over the Internet. However, the MPEG-1 Layer III standard has been designed with a wide range of applications in mind. As such, the frame sizes are kept s...

A subband lter bank is applied to decompose seismic stack sections. The lter bank is designed to give almost perfect reconstruction and maximum coding gain. A variable bit rate coding scheme is used on the sub-band signals. Blocks of subband samples are dynamically classiied into diierent classes according to the blockwise root mean-square value. Each subband sample is then quantized in a unifo...

Context-Based Adaptive Binary Arithmetic Coding (CABAC) is a method of entropy coding first introduced in H.264/AVC and now used in the latest High Efficiency Video Coding (HEVC) standard. While it provides high coding efficiency, the data dependencies in H.264/AVC CABAC make it challenging to parallelize and thus limit its throughput. Accordingly, during the standardization of entropy coding f...

Abstract In this paper we examine various requirements on the formalisation choices under which self-reference can be adequately formalised in arithmetic. particular, study self-referential numberings, immediately provide a strong notion of even for expressively weak languages. The results suggest that question whether truly reasoning arithmetic is more sensitive to underlying coding apparatus ...

This paper reviews recent advances in using B pictures in the context of the draft H.264/AVC video compression standard. We focus on reference picture selection and linearly combined motion-compensated prediction signals. We show that bi-directional prediction exploits partially the efficiency of combined prediction signals whereas multihypothesis prediction allows a more general form of B pict...

A two-stage lossless image compression scheme is presented , the rst stage of which decorrelates the raw image data by using a two-dimensional, causal linear predic-tor, resulting in signiicant entropy reduction. The second stage uses standard coding techniques. Diierent two-stage schemes are compared with respect to their performances on several images, using bilevel coding, arithmetic coding,...

The paper compares frequency domain coders employing two entropy coding schemes: (1) Adaptive classiication of the frequency components followed by entropy coding of each class of components and (2) straightforward, nonclassiied entropy coding of the frequency components. Both schemes use uniform threshold quantization, and the entropy coders are nonadaptive, multialphabet arithmetic coders. To...

This paper represents the Algorithm for various Coding standards such as Huffman coding, Syntax based arithmetic coding and Context Adaptive Binary Arithmetic Coding used in MPEG, H.263 and H.264 respectively and their analysis. We found that average bit per symbol (average code word length) for Huffman coding is nearly equal to Entropy which is the basic requirement, for different bit rate PSN...

We describe new arithmetic coding techniques and side-channel blinding countermeasures for lattice-based cryptography. Using these techniques we develop a practical, compact, and more quantum-resistant variant of the BLISS Ring-LWE Signature Scheme. We first show how the BLISS hash-based random oracle can be modified to be more secure against quantum preimage attacks while optimising signature ...