Sciweavers

19 search results - page 3 / 4
» Polynomial-Time Construction of Spherical Codes
Sort
View
CORR
2007
Springer
99views Education» more  CORR 2007»
13 years 7 months ago
Optimal Routing for Decode-and-Forward based Cooperation in Wireless Networks
Abstract- We investigate cooperative wireless relay networks in which the nodes can help each other in data transmission. We study different coding strategies in the single-source ...
Lawrence Ong, Mehul Motani
DFG
2009
Springer
14 years 2 months ago
Interactive Communication, Diagnosis and Error Control in Networks
s of the work of our research group are given in the following poster of the final meeting. Network Coding Network Coding has emerged as a new paradigm that has influenced Inform...
Rudolf Ahlswede, Harout K. Aydinian
ECOOP
1993
Springer
13 years 12 months ago
Type Inference of SELF
Abstract. We have designed and implemented a type inference algorithm for the Self language. The algorithm can guarantee the safety and disambiguity of message sends, and provide u...
Ole Agesen, Jens Palsberg, Michael I. Schwartzbach
STOC
2006
ACM
130views Algorithms» more  STOC 2006»
14 years 8 months ago
Explicit capacity-achieving list-decodable codes
For every 0 < R < 1 and > 0, we present an explicit construction of error-correcting codes of rate R that can be list decoded in polynomial time up to a fraction (1 - R ...
Venkatesan Guruswami, Atri Rudra
DCC
2001
IEEE
14 years 7 months ago
The Invariants of the Clifford Groups
The automorphism group of the Barnes-Wall lattice Lm in dimension 2m (m = 3) is a subgroup of index 2 in a certain "Clifford group" Cm of structure 21+2m + .O+ (2m, 2). ...
Gabriele Nebe, Eric M. Rains, Neil J. A. Sloane