476 search results - page 12 / 96 » Spread Codes and Spread Decoding in Network Coding |
ISLPED
1995
ACM
15 years 3 months ago
1995
ACM
: CMOS implementations of arithmetic units for One-Hot Residue encoded operands are presented. They are shown to reduce the delay-power product of conventional, fully-encoded desig...
122
click to vote
VTC
2008
IEEE
15 years 6 months ago
2008
IEEE
— This paper presents a novel amalgam of Steered Space-Time Spreading (SSTS) and Orthogonal Frequency Division Multiple Access (OFDMA) designed for attaining both spatial diversi...
101
click to vote
SPAA
2010
ACM
14 years 12 months ago
2010
ACM
We study the communication complexity of rumor spreading in the random phone-call model. Suppose n players communicate in parallel rounds, where in each round every player calls a...
103
click to vote
INFOCOM
2007
IEEE
15 years 6 months ago
2007
IEEE
— In this paper, we present an O(1) time-complexity packet scheduling algorithm which we call G-3 that provides bounded end-to-end delay for fixed size packet networks. G-3 is b...
111
click to vote
INFOCOM
2003
IEEE
15 years 5 months ago
2003
IEEE
— It has been clear since 1988 that self-propagating code can quickly spread across a network by exploiting homogeneous security vulnerabilities. However, the last few years have...