Sciweavers

118 search results - page 12 / 24
» Permutation codes
Sort
View
TIT
2008
87views more  TIT 2008»
14 years 9 months ago
Performance of Parallel Concatenated Coding Schemes
In this paper we study ensembles of parallel concatenated codes and we present precise results on their asymptotic performance. In particular, we prove that We prove that in any p...
Fabio Fagnani
GECCO
2008
Springer
238views Optimization» more  GECCO 2008»
14 years 10 months ago
Using multiple offspring sampling to guide genetic algorithms to solve permutation problems
The correct choice of an evolutionary algorithm, a genetic representation for the problem being solved (as well as their associated variation operators) and the appropriate values...
Antonio LaTorre, José Manuel Peña, V...
ICALP
2005
Springer
15 years 3 months ago
Simple Extractors via Constructions of Cryptographic Pseudo-random Generators
Trevisan has shown that constructions of pseudo-random generators from hard functions (the Nisan-Wigderson approach) also produce extractors. We show that constructions of pseudo-r...
Marius Zimand
CCS
2007
ACM
15 years 1 months ago
A framework for diversifying windows native APIs to tolerate code injection attacks
We present a framework to prevent code injection attacks in MS Windows using Native APIs in the operating system. By adopting the idea of diversity, this approach is implemented i...
Lynette Qu Nguyen, Tufan Demir, Jeff Rowe, Francis...
CORR
2010
Springer
135views Education» more  CORR 2010»
14 years 9 months ago
Constant-Weight Gray Codes for Local Rank Modulation
We consider the local rank-modulation scheme in which a sliding window going over a sequence of real-valued variables induces a sequence of permutations. The local rankmodulation, ...
Moshe Schwartz