Abstract

In this paper, we study the spectral distribution of the product of two random matrices based on binary block codes, and prove that if the dual distances of the underlying codes are large enough, the asymptotic spectral distribution will be close to a deterministic limit in the sense of Levy distance. These results extend our previous work on this topic, and strengthen its applications to joint randomness testing.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.