Sciweavers

21 search results - page 1 / 5
» Capacities on lattices and k-ary capacities
Sort
View
CORR
2010
Springer
115views Education» more  CORR 2010»
13 years 2 months ago
Approximately achieving Gaussian relay network capacity with lattice codes
Abstract--Recently, it has been shown that a quantize-mapand-forward scheme approximately achieves (within a constant number of bits) the Gaussian relay network capacity for arbitr...
Ayfer Özgür, Suhas N. Diggavi
IPSN
2004
Springer
13 years 10 months ago
Lattice sensor networks: capacity limits, optimal routing and robustness to failures
We study network capacity limits and optimal routing algorithms for regular sensor networks, namely, square and torus grid sensor networks, in both, the static case (no node failu...
Guillermo Barrenechea, Baltasar Beferull-Lozano, M...
EUSFLAT
2003
13 years 6 months ago
Capacities on lattices and k-ary capacities
We propose a general notion of capacity defined on any finite distributive lattice, encompassing usual capacities, bi-capacities, and their immediate extensions called k-ary cap...
Michel Grabisch, Christophe Labreuche
CORR
2007
Springer
87views Education» more  CORR 2007»
13 years 4 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
TIT
2010
136views Education» more  TIT 2010»
12 years 11 months ago
The approximate capacity of the many-to-one and one-to-many Gaussian interference channels
Recently, Etkin, Tse, and Wang found the capacity region of the two-user Gaussian interference channel to within 1 bit/s/Hz. A natural goal is to apply this approach to the Gaussia...
Guy Bresler, Abhay Parekh, David N. C. Tse