Small-bias probability spaces: efficient constructions and applications
SIAM Journal on Computing
Decoding Affine Variety Codes Using Gröbner Bases
Designs, Codes and Cryptography
Randomness, adversaries and computation (random polynomial time)
Randomness, adversaries and computation (random polynomial time)
Small-Bias Spaces for Group Products
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Constructing Small-Bias Sets from Algebraic-Geometric Codes
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Footprints or generalized Bezout's theorem
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Polynomial weights and code constructions
IEEE Transactions on Information Theory
On codes from norm-trace curves
Finite Fields and Their Applications
Hi-index | 0.00 |
We propose a new method for constructing small-bias spaces through a combination of Hermitian codes. For a class of parameters our multisets are much faster to construct than what can be achieved by use of the traditional algebraic geometric code construction. So, if speed is important, our construction is competitive with all other known constructions in that region. And if speed is not a matter of interest the small-bias spaces of the present paper still perform better than the ones related to norm-trace codes reported in [12].