Abstract
AbstractFor and pick uniformly at random vectors in and let be the orthogonal complement of their span. Given with , let be the random variable that counts the number of words in of Hamming weight (where is assumed to be an even integer). Linial and Mosheiff [Random Struct. Algorithms. 62 (2023), 68Å°ā130] determined the asymptotics of the moments of of all orders . In this paper we extend their estimates up to moments of linear order. Our key observation is that the behavior of the suitably normalized moment of is essentially determined by the norm of the Krawtchouk polynomial .
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 callDisclaimer: 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.
