Sciweavers

1579 search results - page 39 / 316
» On the Constructions of Constant-Weight Codes
Sort
View
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
15 years 10 months ago
Better extractors for better codes?
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
Venkatesan Guruswami
IPSN
2005
Springer
15 years 3 months ago
A family of distributed space-time trellis codes with asynchronous cooperative diversity
—In current cooperative communication schemes, to achieve cooperative diversity, synchronization between terminals is usually assumed, which may not be practical since each termi...
Yabo Li, Xiang-Gen Xia
TOOLS
2008
IEEE
15 years 4 months ago
Engineering Associations: From Models to Code and Back through Semantics
Association between classes is a central construct in OO modeling. However, precise semantics of associations has not been defined, and only the most basic types are implemented i...
Zinovy Diskin, Steve M. Easterbrook, Jürgen D...
87
Voted
CONCUR
2009
Springer
15 years 4 months ago
Flow Policy Awareness for Distributed Mobile Code
Several programming constructs have recently been proposed with the purpose of enabling the programmer to encode declassifying information flows within a program that complies wi...
Ana Almeida Matos
COCO
2011
Springer
217views Algorithms» more  COCO 2011»
13 years 9 months ago
Noisy Interpolation of Sparse Polynomials, and Applications
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
Shubhangi Saraf, Sergey Yekhanin