Results 281 to 290 of about 122,774 (335)
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
Rissanen, J., Langdon, G. G. jun.
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
Rissanen, J., Langdon, G. G. jun.
openaire +1 more source
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
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.
Šupol, Jan, Melicar, Bořivoj
openaire +2 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.
Šupol, Jan, Melicar, Bořivoj
openaire +2 more sources
2000 IEEE International Symposium on Information Theory (Cat. No.00CH37060), 2002
We study the problem of compressing a block of symbols (a block quantum state) emitted by a memoryless quantum Bernoulli source. We present a simple-to-implement quantum algorithm for projecting, with high probability, the block quantum state onto the typical subspace spanned by the leading eigenstates of its density matrix.
I.L. Chuang, D.S. Modha
openaire +1 more source
We study the problem of compressing a block of symbols (a block quantum state) emitted by a memoryless quantum Bernoulli source. We present a simple-to-implement quantum algorithm for projecting, with high probability, the block quantum state onto the typical subspace spanned by the leading eigenstates of its density matrix.
I.L. Chuang, D.S. Modha
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
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 +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. >
J. Teuhola, T. 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. >
J. Teuhola, T. Raita
openaire +1 more source