2000 character limit reached
Asymptotically Pseudo-Independent Matrices (1809.00408v2)
Published 2 Sep 2018 in math.PR and math.CO
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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
