Papers
Topics
Authors
Recent
Search
2000 character limit reached

Asymptotically Pseudo-Independent Matrices

Published 2 Sep 2018 in math.PR and math.CO | (1809.00408v2)

Abstract: We show that the family of pseudo-random matrices recently discovered by Soloveychik, Xiang, and Tarokh in their work `Symmetric Pseudo-Random Matrices' exhibits asymptotic independence. More specifically, any two sequences of matrices of matching sizes from that construction generated using sequences of different non-reciprocal primitive polynomials are asymptotically independent.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.