64 search results - page 1 / 13 » The Shannon Capacity of a Union |
COMBINATORICA
1998
13 years 4 months ago
1998
For an undirected graph G = (V, E), let Gn denote the graph whose vertex set is V n in which two distinct vertices (u1, u2, . . . , un) and (v1, v2, . . . , vn) are adjacent iff ...
ICC
2008
IEEE
13 years 11 months ago
2008
IEEE
— In this contribution we show how Shannon’s coding theory could be realized for Multiple-Input Multiple-Output (MIMO) channels with the aid of EXtrinsic Information Transfer (...
ICASSP
2010
IEEE
13 years 5 months ago
2010
IEEE
This paper firstly gives a brief overview of information embedding in deoxyribonucleic acid (DNA) sequences and its applications. DNA data embedding can be considered as a partic...
CORR
2006
Springer
13 years 5 months ago
2006
Springer
The independence numbers of powers of graphs have been long studied, under several definitions of graph products, and in particular, under the strong graph product. We show that t...
ICASSP
2011
IEEE
12 years 9 months ago
2011
IEEE
We explore several fundamental questions at the intersection of sampling theory and information theory. In particular, we study how capacity is affected by a given sampling mechan...