Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > SMALL BIAS:
Reports tagged with small bias:
TR09-018 | 8th March 2009
Yoav Tzur

$GF(2^n)$-Linear Tests versus $GF(2)$-Linear Tests

Comments: 1

A small-biased distribution of bit sequences is defined as one withstanding $GF(2)$-linear tests for randomness, which are linear combinations of the bits themselves. We consider linear combinations over larger fields, specifically, $GF(2^n)$ for $n$ that divides the length of the bit sequence. Indeed, this means that we partition the bits ... more >>>




ISSN 1433-8092 | Imprint