1060 search results - page 58 / 212 » Notes on Coding Theory |
101
click to vote
STOC
2006
ACM
15 years 10 months ago
2006
ACM
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 ...
EATCS
2000
14 years 9 months ago
2000
A sub-area of discrepancy theory that has received much attention in computer science recently, is that of explicit constructions of low-discrepancy point sets for various types o...
ENTCS
2002
14 years 9 months ago
2002
The refinement calculus is a well-established theory for translating specifications to program code. Recent research has extended the calculus to handle real-time requirements and...
FFA
2007
14 years 9 months ago
2007
From a rational convex polytope of dimension r ≥ 2 J.P. Hansen constructed an error correcting code of length n = (q−1)r over the finite field Fq. A rational convex polytope...
101
click to vote
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
We consider the problem of resource allocation for a Direct Sequence Code Division Multiple Access (DS-CDMA) wireless visual sensor network (VSN). We use the Nash Bargaining Solut...