Results 211 to 220 of about 15,416 (252)
Some of the next articles are maybe not open access.
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
A Fast Implementation of Arithmetic Coding
2010 12th International Asia-Pacific Web Conference, 2010This paper advances a new lossless data compression method utilizing reversible data hiding to reduce compression times significantly and achieve good compression rates. The core idea of the new approach is to transform a longer binary sequence into a shorter n-ary sequence, transform the n-ary sequence into two binary subsequences, and apply a ...
openaire +1 more source
Error Codes for Arithmetic Operations
IEEE Transactions on Electronic Computers, 1966This paper classifies error correcting codes for arithmetic and provides the necessary and sufficient conditions for the various code classes. Particular attention is given to the arithmetic properties of the codes. It is shown that the Brown codes and the Henderson codes are examples of a general class of nonseparate, nonsystematic codes.
openaire +2 more sources
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
A scheme of parallel arithmetic coding
2011 IEEE International Symposium of Circuits and Systems (ISCAS), 2011This 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 +3 more
openaire +1 more source
On the Security of the Secure Arithmetic Code
IEEE Transactions on Information Forensics and Security, 2009In 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 +2 more
openaire +1 more source
Optimization of Arithmetic Coding for JPEG2000
IEEE Transactions on Circuits and Systems for Video Technology, 2010Embedded 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, 2008This 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 +3 more
openaire +1 more source
Arithmetic coding for data compression
Communications of the ACM, 1987The 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 +2 more
openaire +1 more source
Arithmetic codes with large distance
IEEE Transactions on Information Theory, 1967Summary: 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