An explicit combinatorial design

Details An explicit combinatorial design An explicit combinatorial design

2011-09-28

arxiv.org/abs/1109.6147v1

Mathematics

Combinatorics

Scientific paper

A combinatorial design is a family of sets that are almost disjoint, which is applied in pseudo random number generations and randomness extractions. The parameter, $\rho$, quantifying the overlap between the sets within the family, is directly related to the length of a random seed needed and the efficiency of an extractor. Nisan and Wigderson proposed an explicit construction of designs in 1994. Later in 2003, Hartman and Raz proved a bound of $\rho\le e^2$ for the Nisan-Wigderson construction. In this work, we prove a tighter bound of $\rho

Affiliated with

Also associated with

No associations

Rating

An explicit combinatorial design does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An explicit combinatorial design, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An explicit combinatorial design will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-43320