Results 221 to 230 of about 9,756 (260)

Resynchronization properties of arithmetic coding

Proceedings 1999 International Conference on Image Processing (Cat. 99CH36348), 1999
This 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

A scheme of parallel arithmetic coding

2011 IEEE International Symposium of Circuits and Systems (ISCAS), 2011
This paper presents a parallel arithmetic coding scheme in which supports a large degree of parallelism with a marginal cost in terms of the coding efficiency. The parallelism is brought by coding the bits using multiple arithmetic coders. We identify two types of losses in coding efficiency by breaking the dependency among the data: the loss by ...
Wei Xiao, You Zhou, Jizheng Xu, Guangming Shi   +3 more
openaire   +1 more source

On the Security of the Secure Arithmetic Code

IEEE Transactions on Information Forensics and Security, 2009
In 2007, Kim et al. proposed a secure compression code called the secure arithmetic code (SAC). The code was claimed to be secure against chosen plaintext attacks. However, we find that the SAC is not as secure as the authors have claimed. In this paper, we show the code is prone to two attacks.
Hung-Min Sun, King-Hang Wang, Wei-Chih Ting   +2 more
openaire   +1 more source

Optimization of Arithmetic Coding for JPEG2000

IEEE Transactions on Circuits and Systems for Video Technology, 2010
Embedded block coding with optimized truncation (EBCOT) employed in the JPEG2000 standard accounts for the majority of the processing time, because the EBCOT is full of bit operations that cannot be implemented efficiently in software. The block coder consists of a bit-plane coder (BPC) followed by a binary arithmetic coder (BAC), where the most up-to ...
Minsoo Rhu, In-Cheol Park
openaire   +2 more sources

Cryptanalysis of secure arithmetic coding

2008 IEEE International Conference on Acoustics, Speech and Signal Processing, 2008
This work investigates the security issues of the recently proposed secure arithmetic coding (AC), which is an encryption scheme incorporating the interval splitting AC with a series of symbol and codeword permutations. We propose a chosen-ciphertext attack which is capable of recovering the key vectors for codeword permutations with complexity O(N ...
Jiantao Zhou 0001, Oscar C. Au, Peter Hon-Wah Wong, Xiaopeng Fan 0001   +3 more
openaire   +1 more source

Arithmetic coding for data compression

Communications of the ACM, 1987
The state of the art in data compression is arithmetic coding, not the better-known Huffman method. Arithmetic coding gives greater compression, is faster for adaptive models, and clearly separates the model from the channel encoding.
Ian H. Witten, Radford M. Neal, John G. Cleary   +2 more
openaire   +1 more source

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

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