314 search results - page 17 / 63 » A Comparison of Known Codes, Random Codes, and the Best Code... |
TON
2010
13 years 7 months ago
2010
—We consider opportunistic routing in wireless mesh networks. We exploit the inherent diversity of the broadcast nature of wireless by making use of multi-path routing. We presen...
INFOCOM
2012
IEEE
11 years 11 months ago
2012
IEEE
Abstract— We consider a wireless broadcast station that transmits packets to multiple users. The packet requests for each user may overlap, and some users may already have certai...
DCC
2008
IEEE
14 years 8 months ago
2008
IEEE
Abstract. Orbits of graphs under the operation edge local complementation (ELC) are defined. We show that the ELC orbit of a bipartite graph corresponds to the equivalence class of...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Given a graph G, an identifying code D V (G) is a vertex set such that for any two distinct vertices v1, v2 V (G), the sets N[v1] D and N[v2] D are distinct and nonempty (here...
PQCRYPTO
2010
14 years 16 days ago
2010
The best known non-structural attacks against code-based cryptosystems are based on information-set decoding. Stern’s algorithm and its improvements are well optimized and the co...