Results 221 to 230 of about 15,323 (252)

Coupled distributed arithmetic coding

2011 18th IEEE International Conference on Image Processing, 2011
In this paper, we propose a novel scheme of coupled distributed arithmetic coding to overcome the de-synchronization problem caused by causal decoding in existing distributed arithmetic coding system. Simulation results show that decoding performance is significantly improved and longer sequences outperform shorter sequences using this approach.
Xi Chen, David S. Taubman
openaire   +1 more source

Arithmetic codes with large distance

IEEE Transactions on Information Theory, 1967
Summary: Arithmetic codes are error-correcting or detecting codes implemented by ordinary arithmetic operations. Arithmetic codes with large distance, and therefore, capable of multierror correction are constructed. These codes are analogous to the finite field codes corresponding to maximal recurring sequences generated by shift registers whose ...
openaire   +2 more sources

Equidistant binary arithmetic codes

IEEE Trans. Inf. Theory, 1986
Summary: 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

A fast renormalisation for arithmetic coding

Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225), 2002
Summary form only given. All integer based arithmetic coding consists of two steps: proportional range restriction and range expansion (renormalisation). Here a method is presented that significantly reduces the complexity of renormalisation, allowing a speedup of arithmetic coding by a factor of up to 2.
openaire   +1 more source

Dense coding-a fast alternative to arithmetic coding

Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171), 2002
With dense coding a new method for minimum redundancy coding is introduced. An analysis of arithmetic coding shows, that it is essentially identical to an encoding of discrete intervals. Interval coding is introduced, which encodes symbols directly by encoding the corresponding discrete intervals. Dense coding is an enhanced variant of interval coding,
openaire   +1 more source

On modular weights in arithmetic codes

1988
Les codes arithmetiques sont utilises pour detecter et corriger des erreurs survenant lors d'additions, modulo un entier M strictement positif, effectuees sur des entiers. Pour decrire de maniere adequate le poids de telles erreurs, Garcia et Rao ont introduit la notion de distance modulaire entre entiers (relative a un modulo M>0 et une base r>1), qui
openaire   +1 more source

A note on perfect arithmetic codes

IEEE Trans. Inf. Theory, 1986
Summary: Recently \textit{S. Ernvall} [ibid. IT-28, 665-667 (1982; Zbl 0485.94020)] has characterized all the moduli m for which the arithmetic distance induces a metric of \(Z_ m\). This gives us several new classes of moduli for which it is natural to study the properties of arithmetic codes.
openaire   +2 more sources

Arithmetic codes.

2012
http://archive.org/details ...
openaire   +1 more source

Context-based adaptive binary arithmetic coding in the H.264/AVC video compression standard

IEEE Transactions on Circuits and Systems for Video Technology, 2003
D Marpe, Heiko Schwarz, T Wiegand
exaly  

Multimedia Selective Encryption by Means of Randomized Arithmetic Coding

IEEE Transactions on Multimedia, 2006
Marco Grangetto, G Olmo
exaly