Sciweavers

316 search results - page 58 / 64
» Network Generalized Hamming Weight
Sort
View
CORR
2008
Springer
174views Education» more  CORR 2008»
14 years 12 months ago
Bounded Budget Connection (BBC) Games or How to make friends and influence people, on a budget
Motivated by applications in social networks, peer-to-peer and overlay networks, we define and study the Bounded Budget Connection (BBC) game - we have a collection of n players o...
Nikolaos Laoutaris, Laura J. Poplawski, Rajmohan R...
EMSOFT
2006
Springer
15 years 3 months ago
An analysis framework for network-code programs
Distributed real-time systems require a predictable and verifiable mechanism to control the communication medium. Current real-time communication protocols are typically independe...
Madhukar Anand, Sebastian Fischmeister, Insup Lee
CORR
2007
Springer
151views Education» more  CORR 2007»
14 years 11 months ago
Distributed spatial multiplexing with 1-bit feedback
— We analyze the feasibility of distributed spatial multiplexing with limited feedback in a slow-fading interference network with MN non-cooperating single-antenna sources and M ...
J. Thukral, Helmut Bölcskei
CORR
2007
Springer
158views Education» more  CORR 2007»
14 years 11 months ago
Multi-group ML Decodable Collocated and Distributed Space Time Block Codes
Abstract— In this paper, collocated and distributed spacetime block codes (DSTBCs) which admit multi-group maximum likelihood (ML) decoding are studied. First the collocated case...
G. Susinder Rajan, B. Sundar Rajan
ISAAC
2004
Springer
137views Algorithms» more  ISAAC 2004»
15 years 5 months ago
The Polymatroid Steiner Problems
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
Gruia Calinescu, Alexander Zelikovsky