92 search results - page 16 / 19 » Enumeration, Construction and Random Generation of Block Cod... |
64
Voted
CRYPTO
2001
Springer
15 years 2 months ago
2001
Springer
An (n, m, k)-resilient function is a function f : Fn 2 → Fm 2 such that every possible output m-tuple is equally likely to occur when the values of k arbitrary inputs are fixed ...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We study the communication over Finite State Channels (FSCs), where the encoder and the decoder can control the availability or the quality of the noise-free feedback. Specificall...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
c Modular Abstractions for Template Numerical Constraints David Monniaux May 26, 2010 We propose a method for automatically generating abstract transformstatic analysis by abstrac...
CGO
2008
IEEE
15 years 4 months ago
2008
IEEE
Modern compilers implement a large number of optimizations which all interact in complex ways, and which all have a different impact on code quality, compilation time, code size,...
CODES
2005
IEEE
15 years 3 months ago
2005
IEEE
Arbitrary memory dependencies and variable latency memory systems are major obstacles to the synthesis of large-scale ASIC systems in high-level synthesis. This paper presents SOM...