Sciweavers

314 search results - page 14 / 63
» Arithmetic Coding Revisited
Sort
View
GECCO
2003
Springer
117views Optimization» more  GECCO 2003»
15 years 5 months ago
Uniform Crossover Revisited: Maximum Disruption in Real-Coded GAs
A detailed comparison is presented of five well-known crossover operators on a range of continuous optimization tasks to test longheld beliefs concerning disruption, with respect ...
Stephen Drake
CC
2004
Springer
134views System Software» more  CC 2004»
15 years 3 months ago
Widening Integer Arithmetic
Abstract. Some codes require computations to use fewer bits of precision than are normal for the target machine. For example, Java requires 32-bit arithmetic even on a 64-bit targe...
Kevin Redwine, Norman Ramsey
CRYPTO
2003
Springer
98views Cryptology» more  CRYPTO 2003»
15 years 5 months ago
A Message Authentication Code Based on Unimodular Matrix Groups
We present a new construction based on modular groups. A novel element of our construction is to embed each input into a sequence of matrices with determinant ±1, the product of w...
Matthew Cary, Ramarathnam Venkatesan
ICASSP
2011
IEEE
14 years 3 months ago
A high throughput parallel AVC/H.264 context-based adaptive binary arithmetic decoder
In this paper, based on the proposed parallelization scheme of binary arithmetic decoding, a parallel AVC/H.264 context-based adaptive binary arithmetic coding (CABAC) decoder wit...
Jia-Wei Liang, He-Yuan Lin, Gwo Giun Lee
CORR
2006
Springer
151views Education» more  CORR 2006»
14 years 12 months ago
Coding for Parallel Channels: Gallager Bounds and Applications to Repeat-Accumulate Codes
This paper is focused on the performance analysis of binary linear block codes (or ensembles) whose transmission takes place over independent and memoryless parallel channels. New ...
Igal Sason, Idan Goldenberg