Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

EUSFLAT
2003

favoriteEmaildiscussreport

97views Fuzzy Logic» more EUSFLAT 2003»

Capacities on lattices and k-ary capacities

13 years 6 months ago

Capacities on lattices and k-ary capacities

Download www.eusflat.org

We propose a general notion of capacity deﬁned on any ﬁnite distributive lattice, encompassing usual capacities, bi-capacities, and their immediate extensions called k-ary capacities. We deﬁne key notions such as M¨obius transform, derivative, Shapley value and Choquet integral.

Michel Grabisch, Christophe Labreuche

Real-time Traffic

EUSFLAT 2003 | EUSFLAT 2007 | K-ary Capacities | Usual Capacities | ﬁnite Distributive Lattice |

claim paper

Related Content

» Approximately achieving Gaussian relay network capacity with lattice codes

» Lattice sensor networks capacity limits optimal routing and robustness to failures

» Entropy of capacities on lattices and set systems

» The approximate capacity of the manytoone and onetomany Gaussian interference channels

» List decoding for nested lattices and applications to relay channels

» The Case for Structured Random Codes in Network Capacity Theorems

» A LatticeBased MIMO Broadcast Precoder with Block Diagonalization for MultiStream Transmis...

» A Generalized TwoWay Relay Channel with Private Information for the Relay

» Colouring LinkDirectional Interference Graphs in Wireless Ad Hoc Networks

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2003
Where	EUSFLAT
Authors	Michel Grabisch, Christophe Labreuche

Comments (0)