Results 201 to 210 of about 15,323 (252)
Some of the next articles are maybe not open access.
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
J Rissanen
exaly +2 more sources
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
J Rissanen
exaly +2 more sources
Arithmetic coding for data compression [PDF]
Proceedings of the IEEE, 1994 Arithmetic coding provides an effective mechanism for removing redundancy in the encoding of data. We show how arithmetic coding works and describe an efficient implementation that uses table lookup as a first alternative to arithmetic operations. The reduced-precision arithmetic has a provably negligible effect on the amount of compression achieved ...
J S Vitter
exaly +3 more sources
On the insecurity of arithmetic coding [PDF]
Computers and Security, 1995 John G Cleary
exaly +2 more sources
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
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 +2 more
exaly +2 more sources
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 +2 more
exaly +2 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.
Marco Grangetto +2 more
exaly +3 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.
Marco Grangetto +2 more
exaly +3 more sources
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
Arithmetic norms and bounds of the arithmetic AN codes
IEEE Transactions on Information Theory, 1970Properties of integers, related to the generation of the arithmetic AN codes, are investigated in this paper. A programmable algorithm for the computation of the binary norm of an arbitrary integer is developed. A table of norms of the natural numbers is generated and from this the distribution of integers of a given norm is found.
Albert C. L. Chiang, Irving S. Reed
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
[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