2499 search results - page 151 / 500 » The Serializability of Network Codes |
EJC
2008
14 years 8 months ago
2008
For a graph G and a set D V (G), define Nr[x] = {xi V (G) : d(x, xi) r} (where d(x, y) is graph theoretic distance) and Dr(x) = Nr[x] D. D is known as an r-identifying code if...
80
Voted
VTC
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract—This paper presents an Irregular Distributed Hybrid Concatenated Differential (Ir-DHCD) coding scheme contrived for the relayaided differential decode-and-forward (DDF) ...
93
Voted
IWCMC
2009
ACM
15 years 4 months ago
2009
ACM
Abstract—In this tutorial paper we analyze the capacity of bitinterleaved coded modulation (BICM) with quadrature amplitude modulation (QAM) constellations, and we pay special at...
AINA
2006
IEEE
15 years 4 months ago
2006
IEEE
Given a client/server application, how can the server entrust the integrity of the remote client, albeit the latter is running on an un-trusted machine? To address this research p...
VTC
2006
IEEE
15 years 4 months ago
2006
IEEE
— Based on the specification of a high-throughput wireless local area network system we consider the achievable rate regions of time, frequency and code division multiple access...