Abstract

Typical properties of sparse random matrices over finite (Galois) fields are studied, in the limit oflarge matrices, using techniques from the physics of disordered systems. For the case of a finite fieldGF(q) with primeorder q, we present results for the average kernel dimension, average dimension of the eigenvectorspaces and the distribution of the eigenvalues. The number of matrices for a givendistribution of entries is also calculated for the general case. The significance of theseresults to error-correcting codes and random graphs is also discussed.

Full Text
Paper version not known

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.