@sapphiremath

Thanks a lot.

I found many GV bounds in the literature:
1. Based on the  H matrix columns.
2. Based on a greedy algorithm.
3.Based on the probabilistic approach.
4. The asymptotic one with étropy function.


Questions: 
1 ..How to relate between the first 3 ?
2. Is the entropy function in the asymptotic GV bound is mere mathematical convenience or it has something else.

I am sorry. I know these questions are too broad for the comment section but I m totally lost. I just need references where I can get answers. Especially for the asymptotic one.

Thanks a lot in advance.

@PaoloLammens

Is k defined as n - log_q(Vol_q(d-1, n)) - 1 an integer? Like why is log_q(Vol_q(d-1, n)) an integer?

@aimihat

wow - thanks Mary

@blakemcalevey-scurr1454

Im struggling to prove the useful fact to myself unfortunately. I'm trying to either prove that the basis vectors for the generator are uniformly random (except 0), and I've also tried counting the number of subspaces and generators but it's tricky. Any ideas?

I also noticed that any permutation of Gx is equally likely, as for every choice of subspace there's another for every permutation of the rows of G. Still unsure if some field elements are more common in Gx.

@PepeGR5

Is "q" in "Fq" where F is a finite field --> q = p^t??