Results 1  10
of
64,333
Arithmetic coding
 IBM J. Res. Develop
, 1979
"... Arithmetic coding is a data compression technique that encodes data (the data string) by creating a code string which represents a fractional value on the number line between 0 and 1. The coding algorithm is symbolwise recursive; i.e., it operates upon and encodes (decodes) one data symbol per itera ..."
Abstract

Cited by 266 (1 self)
 Add to MetaCart
Arithmetic coding is a data compression technique that encodes data (the data string) by creating a code string which represents a fractional value on the number line between 0 and 1. The coding algorithm is symbolwise recursive; i.e., it operates upon and encodes (decodes) one data symbol per
Arithmetic Coding
"... 6> (xn=a i jx 1 ; : : : ; xn\Gamma1 ) and uses it to interpret the received message. A binary transmission can be viewed as defining an interval within the real line from 0 to 1. For example, the transmission 01 is interpreted as a binary real number 0.01: : : , which corresponds to the interval ..."
Abstract
 Add to MetaCart
6> (xn=a i jx 1 ; : : : ; xn\Gamma1 ) and uses it to interpret the received message. A binary transmission can be viewed as defining an interval within the real line from 0 to 1. For example, the transmission 01 is interpreted as a binary real number 0.01: : : , which corresponds to the interval [0:01; 0:10) (binary), i.e., the interval [0:25; 0:50] (base ten). A longer transmission 01101 corresponds to the interval [0:01101; 0:01110); because 01101 has the first string 01 as a prefix, the new interval is a subinterval of the interval [0:01; 0:10]. A one megabyte binary file (2 2 3 bits) is thus viewed as specifying a number between 0 and 1 to a precision of about 10
Practical Implementations of Arithmetic Coding
 IN IMAGE AND TEXT
, 1992
"... We provide a tutorial on arithmetic coding, showing how it provides nearly optimal data compression and how it can be matched with almost any probabilistic model. We indicate the main disadvantage of arithmetic coding, its slowness, and give the basis of a fast, spaceefficient, approximate arithmet ..."
Abstract

Cited by 42 (6 self)
 Add to MetaCart
We provide a tutorial on arithmetic coding, showing how it provides nearly optimal data compression and how it can be matched with almost any probabilistic model. We indicate the main disadvantage of arithmetic coding, its slowness, and give the basis of a fast, spaceefficient, approximate
Tutorial on Arithmetic Coding
, 1994
"... This document explains background material for the filing of two patents, Efficient interval width update in arithmetic coding, and Design of fast circuits for code point update in arithmetic coding. The aim is to give the reader the necessary technical foundation to understand the ideas in the pate ..."
Abstract
 Add to MetaCart
This document explains background material for the filing of two patents, Efficient interval width update in arithmetic coding, and Design of fast circuits for code point update in arithmetic coding. The aim is to give the reader the necessary technical foundation to understand the ideas
Arithmetic Coding for Noisy Channels
, 1999
"... Arithmetic Coding is generalized to provide a method for transforming source output sequences into sequences whose probability distribution approaches any desired probability distribution. A further modification in which gaps are introduced between source intervals allows arithmetic encoders to prod ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Arithmetic Coding is generalized to provide a method for transforming source output sequences into sequences whose probability distribution approaches any desired probability distribution. A further modification in which gaps are introduced between source intervals allows arithmetic encoders
Arithmetic Coding with Folds and Unfolds
 Advanced Functional Programming, 4th International Summer School
, 2003
"... Introduction Arithmetic coding is a method for data compression. Although the idea was developed in the 1970's, it wasn't until the publication of an "accessible implementation " [14] that it achieved the popularity it has today. Over the past ten years arithmetic coding has bee ..."
Abstract

Cited by 10 (5 self)
 Add to MetaCart
Introduction Arithmetic coding is a method for data compression. Although the idea was developed in the 1970's, it wasn't until the publication of an "accessible implementation " [14] that it achieved the popularity it has today. Over the past ten years arithmetic coding has
and Log in Arithmetic Coding
"... Arithmetic coding is a very efficient and most popular entropy coding technique. Arithmetic coding method is based on the fact that the cumulative probability of a symbol sequence corresponds to a unique subinterval of the initial interval [0, 1). In this method, when encoding a symbol, it first com ..."
Abstract
 Add to MetaCart
Arithmetic coding is a very efficient and most popular entropy coding technique. Arithmetic coding method is based on the fact that the cumulative probability of a symbol sequence corresponds to a unique subinterval of the initial interval [0, 1). In this method, when encoding a symbol, it first
Arithmetic Coding for Data Compression
 COMMUNICATIONS OF THE ACM
, 1987
"... Arithmetic coding is superior in most respects to the betterknown Huffman method. It represents information at least as compactlysometimes considerably more so. Its performance is optimal without the need for blocking of input data. It encourages a clear separation between the model for repres ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Arithmetic coding is superior in most respects to the betterknown Huffman method. It represents information at least as compactlysometimes considerably more so. Its performance is optimal without the need for blocking of input data. It encourages a clear separation between the model
Arithmetic Coding in Parallel
"... Abstract. We present a cost optimal parallel algorithm for the computation of arithmetic coding. We solve the problem in O(log n) time using n/log n processors on EREW PRAM. This leads to O(n) total cost. ..."
Abstract
 Add to MetaCart
Abstract. We present a cost optimal parallel algorithm for the computation of arithmetic coding. We solve the problem in O(log n) time using n/log n processors on EREW PRAM. This leads to O(n) total cost.
Arithmetic Coding in Parallel
"... Abstract. We present a cost optimal parallel algorithm for the computation of arithmetic coding. We solve the problem in O(log n) time using n/log n processors on EREW PRAM. This leads to O(n) total cost. ..."
Abstract
 Add to MetaCart
Abstract. We present a cost optimal parallel algorithm for the computation of arithmetic coding. We solve the problem in O(log n) time using n/log n processors on EREW PRAM. This leads to O(n) total cost.
Results 1  10
of
64,333