Sciweavers

314 search results - page 2 / 63
» Arithmetic Coding Revisited
Sort
View
CASC
2011
Springer
262views Mathematics» more  CASC 2011»
12 years 7 months ago
Practical Divide-and-Conquer Algorithms for Polynomial Arithmetic
We investigate two practical divide-and-conquer style algorithms for univariate polynomial arithmetic. First we revisit an algorithm originally described by Brent and Kung for comp...
William Hart, Andrew Novocin
BIRTHDAY
2007
Springer
14 years 1 months ago
The Hydra Battle Revisited
Showing termination of the Battle of Hercules and Hydra is a challenge. We present the battle both as a rewrite system and as an arithmetic while program, provide proofs of their t...
Nachum Dershowitz, Georg Moser
CORR
2007
Springer
115views Education» more  CORR 2007»
13 years 7 months ago
Q-adic Transform revisited
We present an algorithm to perform a simultaneous modular reduction of several residues. This enables to compress polynomials into integers and perform several modular operations ...
Jean-Guillaume Dumas
DCC
2004
IEEE
13 years 11 months ago
Joint Source-Channel Decoding of Quasi-Arithmetic Codes
This paper addresses the issue of robust and joint source-channel decoding of quasiarithmetic codes. Quasi-arithmetic coding is a reduced precision and complexity implementation o...
Thomas Guionnet, Christine Guillemot
ICIP
2007
IEEE
14 years 9 months ago
Overlapped Quasi-Arithmetic Codes for Distributed Video Coding
This paper describes Slepian-Wolf codes based on overlapped quasi-arithmetic codes, where overlapping allows lossy compression of the source below its entropy. In the context of s...
Xavier Artigas, Simon Malinowski, Christine Guille...