Results 311 to 320 of about 2,963,905 (354)
Some of the next articles are maybe not open access.
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
A fast renormalisation for arithmetic coding
Proceedings DCC '98 Data Compression Conference (Cat. No.98TB100225), 2002Summary 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
A note on perfect arithmetic codes
IEEE Trans. Inf. Theory, 2020Summary: 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
Dense coding-a fast alternative to arithmetic coding
Proceedings. Compression and Complexity of SEQUENCES 1997 (Cat. No.97TB100171), 2002With 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
Reversible Natural Language Watermarking Using Synonym Substitution and Arithmetic Coding
, 2018Wei Hao +4 more
semanticscholar +1 more source
On modular weights in arithmetic codes
1988Les 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
Arithmetic coding and blinding countermeasures for lattice signatures
Journal of Cryptographic Engineering, 2017Markku-Juhani O. Saarinen
semanticscholar +1 more source
Communications in nonlinear science & numerical simulation, 2015
Yushu Zhang +4 more
semanticscholar +1 more source
Yushu Zhang +4 more
semanticscholar +1 more source