An Almost m-wise Independent Random Permutation of the Cube-Reference-Cited by-同舟云学术

An Almost m-wise Independent Random Permutation of the Cube

Published:1996-06 Issue:2 Volume:5 Page:119-130
ISSN:0963-5483
Container-title:Combinatorics, Probability and Computing
language:en
Short-container-title:Combinator. Probab. Comp.

Author:

Gowers W. T.

Abstract

We describe a very simple method of randomly permuting the cube {0, 1}n such that the sample space is very small, but, given any m distinct points in {0, 1}n, the images of those points under the random permutation are approximately uniformly distributed over all sequences of m distinct points.

Publisher

Cambridge University Press (CUP)

Subject

Applied Mathematics,Computational Theory and Mathematics,Statistics and Probability,Theoretical Computer Science

Reference10 articles.

1. Pseudorandom bits for constant depth circuits

2. How to Construct Pseudorandom Permutations from Pseudorandom Functions

3. Approximate Inclusion-Exclusion

4. Geometric Bounds for Eigenvalues of Markov Chains

5. Fast uniform generation of regular graphs

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Explicit orthogonal and unitary designs;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

2. Pseudorandom Generators with Optimal Seed Length for Non-Boolean Poly-Size Circuits;ACM Transactions on Computation Theory;2017-05-12

3. Fast Pseudorandom Functions Based on Expander Graphs;Theory of Cryptography;2016

4. Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs;Journal of the ACM;2015-12-10

5. Pseudorandom generators with optimal seed length for non-boolean poly-size circuits;Proceedings of the forty-sixth annual ACM symposium on Theory of computing;2014-05-31