2655 search results - page 9 / 531 » LT Network Codes |
TIT
2010
13 years 2 months ago
2010
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...
TAMC
2007
Springer
14 years 1 months ago
2007
Springer
For generalized Reed-Solomon codes, it has been proved [7] that the problem of determining if a received word is a deep hole is coNP-complete. The reduction relies on the fact that...
TIT
2008
13 years 7 months ago
2008
We present error-correcting codes that achieve the information-theoretically best possible trade-off between the rate and error-correction radius. Specifically, for every 0 < R...
GLOBECOM
2008
IEEE
13 years 9 months ago
2008
IEEE
Abstract— This paper discusses channel estimation in a cooperative orthogonal frequency-division multiplexing (OFDM) network in the presence of frequency offsets. Both the amplif...
MOBIHOC
2010
ACM
13 years 5 months ago
2010
ACM
We investigate the scalability of a class of algorithms that exploit the dynamics of wireless fading channels to achieve secret communication in a large wireless network of n rando...