Sciweavers

8 search results - page 2 / 2
» Tight Bounds for Hashing Block Sources
Sort
View
CORR
2007
Springer
97views Education» more  CORR 2007»
13 years 5 months ago
Side-information Scalable Source Coding
Abstract—We consider the problem of side-information scalable (SI-scalable) source coding, where the encoder constructs a two-layer description, such that the receiver with high ...
Chao Tian, Suhas N. Diggavi
ACSAC
2004
IEEE
13 years 9 months ago
A Dynamic Technique for Eliminating Buffer Overflow Vulnerabilities (and Other Memory Errors)
Buffer overflow vulnerabilities are caused by programming errors that allow an attacker to cause the program to write beyond the bounds of an allocated memory block to corrupt oth...
Martin C. Rinard, Cristian Cadar, Daniel Dumitran,...
VTC
2008
IEEE
13 years 11 months ago
High Rate Two-Way Amplify-and-Forward Half-Duplex Relaying with OSTBC
—In this paper, we derive tight upper and lower bounds for the average sum rate of two-way amplify-andforward (AF) half-duplex relaying, which show that two-way AF half-duplex re...
Yang Han, See Ho Ting, Chin Keong Ho, Woon Hau Chi...