CORR
2007
Springer
13 years 7 months ago
2007
Springer
CORR
2007
Springer
13 years 7 months ago
2007
Springer
The problem of coding for channels with time-varying state is studied. Two different models are considered: one in which the channel state cannot depend on the transmitted signal,...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We consider signals and operators in finite dimension which have sparse time-frequency representations. As main result we show that an S-sparse Gabor representation in Cn with re...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Safety-criticalembeddedsystems having to meet real-time constraints are to be highlypredictable in order to guarantee at design time that certain timing deadlines will always be m...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
but other abstract objects as well (e.g., states, processes, properties, activities, attributes, etc.) It will be demonstrated here that in such a framework, a number of challenges...
CORR
2007
Springer
13 years 7 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 7 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 7 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 7 months ago
2007
Springer
CORR
2007
Springer
13 years 7 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...