118 search results - page 8 / 24 » Permutation codes |
EVOW
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. The fitness distance correlation (FDC) as a measure for problem difficulty was first introduced by Forrest and Jones. It was applied to many binary coded problems. This...
ACSAC
2006
IEEE
15 years 5 months ago
2006
IEEE
Address space randomization is an emerging and promising method for stopping a broad range of memory corruption attacks. By randomly shifting critical memory regions at process in...
TIT
2008
14 years 11 months ago
2008
The problem of transmission of information over arbitrarily permuted parallel channels is studied here. The transmitter does not know over which channel a certain codesequence will...
87
Voted
TWC
2010
14 years 6 months ago
2010
In this letter the performance limits and design principles of rateless codes over fading channels are studied. The diversity-multiplexing tradeoff (DMT) is used to analyze the sys...
FFA
2007
14 years 11 months ago
2007
We present a new construction for (n, w, λ)-optical orthogonal codes (OOCs). The construction is pleasingly simple, where codewords correspond to arcs, specifically normal ratio...