44 search results - page 3 / 9 » Constructing Good Covering Codes for Applications in Stegano... |
IMA
2001
Springer
13 years 9 months ago
2001
Springer
A recursive construction is provided for sequence sets which possess good Hamming Distance and low Peak-to-Average Power Ratio (PAR) under any Local Unitary Unimodular Transform. W...
HPDC
2008
IEEE
13 years 5 months ago
2008
IEEE
Basic data flow patterns which we call idioms, such as stream, transpose, reduction, random access and stencil, are common in scientific numerical applications. We hypothesize tha...
TIT
1998
13 years 5 months ago
1998
—We investigate a new class of codes for the optimal covering of vertices in an undirected graph Gsuch that any vertex in G can be uniquely identified by examining the vertices ...
CRYPTO
1999
Springer
13 years 9 months ago
1999
Springer
Abstract. We consider the broadcast exclusion problem: how to transmit a message over a broadcast channel shared by N = 2n users so that all but some specified coalition of k excl...
HASE
2008
IEEE
13 years 11 months ago
2008
IEEE
Web applications often use dynamic pages that interact with each other by accessing shared objects, e.g., session objects. Interactions between dynamic pages need to be carefully ...