Sciweavers

3122 search results - page 159 / 625
» A Theory of Network Equivalence
Sort
View
TIT
2011
144views more  TIT 2011»
15 years 1 months ago
Network Generalized Hamming Weight
— In this paper, we extend the notion of generalized Hamming weight for classical linear block code to linear network codes by introducing the network generalized Hamming weight ...
Chi Kin Ngai, Raymond W. Yeung, Zhen Zhang
ICIP
2008
IEEE
16 years 8 months ago
Nonconvex compressive sensing and reconstruction of gradient-sparse images: Random vs. tomographic Fourier sampling
Previous compressive sensing papers have considered the example of recovering an image with sparse gradient from a surprisingly small number of samples of its Fourier transform. T...
Rick Chartrand
DCC
2008
IEEE
16 years 6 months ago
Coprimitive sets and inextendable codes
Complete (n, r)-arcs in PG(k - 1, q) and projective (n, k, n - r)q-codes that admit no projective extensions are equivalent objects. We show that projective codes of reasonable le...
T. L. Alderson, Aiden A. Bruen
INFOCOM
2007
IEEE
16 years 23 days ago
Fundamental Complexity of Optical Systems
Abstract—It is often claimed that future systems will necessarily be all-optical, because electronic devices are not fast enough to keep up with the increase in fiber capacity. ...
Hadas Kogan, Isaac Keslassy
FSEN
2007
Springer
16 years 19 days ago
Logical Bisimulations and Functional Languages
Developing a theory of bisimulation in higher-order languages can be hard. Particularly challenging can be the proof of congruence and, related to this, enhancements of the bisimul...
Davide Sangiorgi, Naoki Kobayashi, Eijiro Sumii