CORR
2007
Springer
13 years 4 months ago
2007
Springer
Distributed source coding schemes are typically based on the use of channels codes as source codes. In this paper we propose a new paradigm, termed “distributed arithmetic codin...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
We consider a multi-channel opportunistic communication system where the states of these channels evolve as independent and statistically identical Markov chains (the Gilbert-Elli...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
For digraphs G and H, a homomorphism of G to H is a mapping f : V (G)→V (H) such that uv ∈ A(G) implies f(u)f(v) ∈ A(H). If, moreover, each vertex u ∈ V (G) is associated ...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
CORR
2007
Springer
13 years 4 months ago
2007
Springer
We define a class of “algebraic” random matrix channels for which one can generically compute the limiting Shannon transform using numerical techniques and often enumerate th...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
Local (first order) sentences, introduced by Ressayre, enjoy very nice decidability properties, following from some stretching theorems stating some remarkable links between the ...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
12
Voted
CORR
2007
Springer
13 years 4 months ago
2007
Springer
Orienteering is the following optimization problem: given an edge-weighted graph (directed or undirected), two nodes s, t and a time limit T, find an s-t walk of total length at ...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
CORR
2007
Springer
13 years 4 months ago
2007
Springer