Results 301 to 310 of about 2,970,762 (373)
Some of the next articles are maybe not open access.
On majority-logic-decodable arithmetic codes
IEEE Transactions on Information Theory, 1973R Chien
exaly +2 more sources
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
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
[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
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
Equidistant binary arithmetic codes
IEEE Trans. Inf. Theory, 2023Summary: Let C(B) denote the binary cyclic AN code with generator A, where \(AB=2^ n-1\). It is known that C(B) is equidistant if B is a prime power \(p^ k\), where either 2 or -2 is primitive modulo B provided \(p\equiv 1\) (mod 3) if \(k>1\). It is conjectured that these are the only B such that C(B) is equidistant.
William Edwin Clark, Joseph J. Liang
openaire +1 more source
Resynchronization properties of arithmetic coding
Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348), 1999This paper considers decoding an arithmetic code stream when an initial portion of the code stream is unknown. Full resynchronization is hypothesized to have complexity that is exponential in the length of the initial portion. Experimental results specify the time complexity of determining the current arithmetic code interval, which is the important ...
Peter W. Moo, Xiaolin Wu 0001
openaire +1 more source