170 search results - page 2 / 34 » Constructing Small-Bias Sets from Algebraic-Geometric Codes |
DM
2007
13 years 5 months ago
2007
We construct families of three-dimensional linear codes that attain the Griesmer bound and give a probablistic construction of linear codes that are close to the Griesmer bound. Al...
ECCC
2010
13 years 7 hour ago
2010
Trevisan [Tre03] suggested a transformation that allows amplifying the error rate a code can handle. We observe that this transformation, that was suggested in the non-local setti...
STOC
2005
ACM
14 years 5 months ago
2005
ACM
We investigate constructions of pseudorandom generators that fool polynomial tests of degree d in m variables over finite fields F. Our main construction gives a generator with se...
ASIACRYPT
2008
Springer
13 years 7 months ago
2008
Springer
Strongly multiplicative linear secret sharing schemes (LSSS) have been a powerful tool for constructing secure multi-party computation protocols. However, it remains open whether o...
DCC
2004
IEEE
14 years 4 months ago
2004
IEEE
We study sets of lines of AG(n, q) and PG(n, q) with the property that no three lines form a triangle. As a result the associated point-line incidence graph contains no 6-cycles a...