19 search results - page 3 / 4 » On the Characterization of Linear Uniquely Decodable Codes |
CIC
2006
13 years 7 months ago
2006
- We investigate the simplest Slepian-Wolf source network, consisting of an information source correlated with a second source used as a side-information for the decoder but not th...
GECCO
2003
Springer
13 years 11 months ago
2003
Springer
Abstract. Page-based Linear Genetic Programming (GP) is proposed and implemented with two-layer Subset Selection to address a two-class intrusion detection classification problem a...
FOCS
1999
IEEE
13 years 10 months ago
1999
IEEE
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
CRYPTO
2005
Springer
13 years 11 months ago
2005
Springer
Error correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, we study the connections between codes, matroids, and a s...
CORR
2010
Springer
13 years 22 days ago
2010
Springer
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...