314 search results - page 3 / 63 » A Comparison of Known Codes, Random Codes, and the Best Code... |
SODA
2008
ACM
13 years 7 months ago
2008
ACM
We prove that binary linear concatenated codes with an outer algebraic code (specifically, a folded Reed-Solomon code) and independently and randomly chosen linear inner codes ach...
ICCCN
2007
IEEE
14 years 2 days ago
2007
IEEE
—For real-time wireless communications, short forward error-correcting (FEC) codes are indispensable due to the strict delay requirement. In this paper we study the performance o...
ACSAC
2006
IEEE
13 years 11 months ago
2006
IEEE
Instruction Set Randomization (ISR) has been proposed as a form of defense against binary code injection into an executing program. One proof-of-concept implementation is Randomiz...
GLOBECOM
2009
IEEE
14 years 15 days ago
2009
IEEE
—In this work, we prove that a positive secure degree of freedom is achievable for a large class of real Gaussian channels as long as the channel is not degraded and the channel ...
STOC
2000
ACM
13 years 9 months ago
2000
ACM
We give efficient (polynomial-time) list-decoding algorithms for certain families of errorcorrecting codes obtained by "concatenation". Specifically, we give list-decodi...