2000 character limit reached
The rank of random matrices over finite fields
Published 17 Oct 2018 in math.CO, cs.DM, cs.IT, and math.IT | (1810.07390v1)
Abstract: We determine the rank of a random matrix A over a finite field with prescribed numbers of non-zero entries in each row and column. As an application we obtain a formula for the rate of low-density parity check codes. This formula verifies a conjecture of Lelarge [Proc. IEEE Information Theory Workshop 2013]. The proofs are based on coupling arguments and the interpolation method from mathematical physics.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.