Results 211 to 220 of about 9,756 (260)
Some of the next articles are maybe not open access.
On the Timeliness of Arithmetic Coding
2021 IEEE International Symposium on Information Theory (ISIT), 2021Timeliness of information transfer is critical in real-time applications. Prioritizing timeliness, however, often comes at the cost of rate inefficiency, especially in block coding. In this work, motivated by the sequential nature of encoding and decoding in arithmetic source coding, the timeliness of arithmetic coding is investigated.
Shirin Saeedi Bidokhti, Aylin Yener
openaire +1 more source
IBM Journal of Research and Development, 1979
The earlier introduced arithmetic coding idea has been generalized to a very broad and flexible coding technique which includes virtually all known variable rate noiseless coding techniques as special cases. An outstanding feature of this technique is that alphabet extensions are not required. A complete decodability analysis is given. The relationship
Jorma Rissanen, Glen G. Langdon Jr.
openaire +1 more source
The earlier introduced arithmetic coding idea has been generalized to a very broad and flexible coding technique which includes virtually all known variable rate noiseless coding techniques as special cases. An outstanding feature of this technique is that alphabet extensions are not required. A complete decodability analysis is given. The relationship
Jorma Rissanen, Glen G. Langdon Jr.
openaire +1 more source
International Journal of Foundations of Computer Science, 2005
We present an EREW PRAM cost optimal parallel algorithm for arithmetic coding computation. We solve the problem in [Formula: see text] time using n/log n processors. Each part of the algorithm as well as a well-known parallel prefix computation forming a basis of the algorithm are clarified on simple examples.
Jan Supol, Borivoj Melichar
openaire +3 more sources
We present an EREW PRAM cost optimal parallel algorithm for arithmetic coding computation. We solve the problem in [Formula: see text] time using n/log n processors. Each part of the algorithm as well as a well-known parallel prefix computation forming a basis of the algorithm are clarified on simple examples.
Jan Supol, Borivoj Melichar
openaire +3 more sources
IEEE Communications Letters, 2007
We propose a distributed binary arithmetic coder for Slepian-Wolf coding with decoder side information, along with a soft joint decoder. The proposed scheme provides several advantages over existing schemes, and its performance is equal to or better than that of an equivalent scheme based on turbo codes at short and medium block lengths.
GRANGETTO, MARCO +2 more
openaire +2 more sources
We propose a distributed binary arithmetic coder for Slepian-Wolf coding with decoder side information, along with a soft joint decoder. The proposed scheme provides several advantages over existing schemes, and its performance is equal to or better than that of an equivalent scheme based on turbo codes at short and medium block lengths.
GRANGETTO, MARCO +2 more
openaire +2 more sources
[1991] Proceedings. Data Compression Conference, 2002
A new coding technique, FIXARI, is easily programmed to produce fixed-length codewords quickly for partial decoding and indexing. Errors in transmission (bit switches) remain local to the keyboard. >
Jukka Teuhola, Timo Raita
openaire +1 more source
A new coding technique, FIXARI, is easily programmed to produce fixed-length codewords quickly for partial decoding and indexing. Errors in transmission (bit switches) remain local to the keyboard. >
Jukka Teuhola, Timo Raita
openaire +1 more source
IEEE Transactions on Signal Processing, 2007
Although arithmetic coding offers extremely high coding efficiency, it provides little or no security as traditionally implemented. We present a modified scheme that offers both encryption and compression. The system utilizes an arithmetic coder in which the overall length within the range [0,1) allocated to each symbol is preserved, but the ...
Hyungjin Kim 0003 +2 more
openaire +1 more source
Although arithmetic coding offers extremely high coding efficiency, it provides little or no security as traditionally implemented. We present a modified scheme that offers both encryption and compression. The system utilizes an arithmetic coder in which the overall length within the range [0,1) allocated to each symbol is preserved, but the ...
Hyungjin Kim 0003 +2 more
openaire +1 more source
Arithmetic Codes for Constrained Channels
IBM Journal of Research and Development, 1983Arithmetic codes have been studied in the context of compression coding, i.e., transformations to code strings which take up less storage space or require less transmission time over a communications link. Another application of coding theory is that of noiseless channel coding, where constraints on strings in the channel symbol alphabet prevent an ...
G. Nigel Martin +2 more
openaire +2 more sources
An Introduction to Arithmetic Coding
IBM Journal of Research and Development, 1984Summary: 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 iteration or recursion.
openaire +1 more source
An Algebraic Model of Arithmetic Codes
IEEE Transactions on Computers, 1982Arithmetic codes use a structured redundancy technique for binary number representation such that errors in an arithmetic operation of a digital computer can be detected or corrected. This correspondence studies the code structures by treating the set of redundant coded binary representations as a finite Abelian group.
openaire +1 more source
A Fast Implementation of Arithmetic Coding
2010 12th International Asia-Pacific Web Conference, 2010This paper advances a new lossless data compression method utilizing reversible data hiding to reduce compression times significantly and achieve good compression rates. The core idea of the new approach is to transform a longer binary sequence into a shorter n-ary sequence, transform the n-ary sequence into two binary subsequences, and apply a ...
openaire +1 more source