24 search results - page 3 / 5 » The Case for Structured Random Codes in Network Capacity The... |
CORR
2010
Springer
13 years 22 days ago
2010
Springer
Shannon defined channel capacity as the highest rate at which there exists a sequence of codes of block length n such that the error probability goes to zero as n goes to infinity....
GECCO
2006
Springer
13 years 9 months ago
2006
Springer
Recently, studies with the XCS classifier system on Boolean functions have shown that in certain types of functions simple crossover operators can lead to disruption and, conseque...
TIT
2010
13 years 15 days 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...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Abstract--The problem of network coding for multicasting a single source to multiple sinks has first been studied by Ahlswede, Cai, Li and Yeung in 2000, in which they have establi...
BC
2002
13 years 5 months ago
2002
Taking a global analogy with the structure of perceptual biological systems, we present a system composed of two layers of real-valued sigmoidal neurons. The primary layer receives...