Sciweavers

64 search results - page 3 / 13
» The Shannon Capacity of a Union
Sort
View
COMBINATORICA
2007
126views more  COMBINATORICA 2007»
13 years 7 months ago
Privileged users in zero-error transmission over a noisy channel
The k-th power of a graph G is the graph whose vertex set is V (G)k , where two distinct ktuples are adjacent iff they are equal or adjacent in G in each coordinate. The Shannon ...
Noga Alon, Eyal Lubetzky
TIT
2010
81views Education» more  TIT 2010»
13 years 2 months ago
Generalizing capacity: new definitions and capacity theorems for composite channels
We consider three capacity definitions for composite channels with channel side information at the receiver. A composite channel consists of a collection of different channels with...
Michelle Effros, Andrea J. Goldsmith, Yifan Liang
MP
2008
99views more  MP 2008»
13 years 7 months ago
Compact formulations as a union of polyhedra
We explore one method for finding the convex hull of certain mixed integer sets. The approach is to break up the original set into a small number of subsets, find a compact polyhed...
Michele Conforti, Laurence A. Wolsey
CORR
2007
Springer
87views Education» more  CORR 2007»
13 years 7 months ago
Entropy of capacities on lattices and set systems
We propose a definition for the entropy of capacities defined on lattices. Classical capacities are monotone set functions and can be seen as a generalization of probability mea...
Aoi Honda, Michel Grabisch
CORR
2010
Springer
103views Education» more  CORR 2010»
13 years 5 months ago
Least Squares Superposition Codes of Moderate Dictionary Size, Reliable at Rates up to Capacity
Sparse superposition codes are developed for the additive white Gaussian noise channel with average codeword power constraint. Codewords are linear combinations of subsets of vecto...
Andrew R. Barron, Antony Joseph