Sciweavers

2499 search results - page 122 / 500
» The Serializability of Network Codes
Sort
View
CORR
2008
Springer
88views Education» more  CORR 2008»
14 years 10 months ago
Coding Strategies for Noise-free Relay Cascades with Half-Duplex Constraint
Abstract--Two types of noise-free relay cascades are investigated. Networks where a source communicates with a distant receiver via a cascade of half-duplex constrained relays, and...
Tobias Lutz, Christoph Hausl, Ralf Koetter
ICC
2009
IEEE
165views Communications» more  ICC 2009»
14 years 7 months ago
Coding-Aware Scheduling for Reliable Many-to-One Flows
We revisit the problem of scheduling the sources transmissions in a many-to-one flow to provide reliable communication between n sources and a single destination. The performance o...
Osameh M. Al-Kofahi, Ahmed E. Kamal
SIGCOMM
1996
ACM
15 years 2 months ago
DPF: Fast, Flexible Message Demultiplexing Using Dynamic Code Generation
Fast and flexible message demultiplexing are well-established goals in the networking community [1, 18, 22]. Currently, however, network architects have had to sacrifice one for t...
Dawson R. Engler, M. Frans Kaashoek
ICIP
2005
IEEE
15 years 11 months ago
The role of the virtual channel in distributed source coding of video
In distributed video source coding side-information at the decoder is generated as a temporal prediction based on previous frames. This creates a virtual dependency channel betwee...
Ronald P. Westerlaken, Rene Klein Gunnewiek, Inald...
ICC
2007
IEEE
104views Communications» more  ICC 2007»
15 years 4 months ago
Time-and-Frequency-Hopping Optical Orthogonal Codes with Hierarchical Cross-Correlation Constraints for Service Differentiation
— In this paper, we consider time-and-frequency hopping (TFH) codes for optical code-division multiple-access (OCDMA) networks. To support the differentiated service requirements...
Chung-Keun Lee, Seung-Woo Seo