Dependent sets of constant weight vectors in GF(q)
暂无分享,去创建一个
We determine lower bounds for the number of random vectors in GF (q), chosen uniformly from vectors having k non-zero co-ordinates, needed to obtain a dependent set over GF (q).
[1] V. F. Kolchin,et al. Hypercycles in a random hypergraph , 1992 .
[2] V. F. Kolchin,et al. Random Graphs and Systems of Linear Equations in Finite Fields , 1994, Random Struct. Algorithms.
[3] V. F. Kolchin,et al. A threshold effect for systems of random equations of a special form , 1995 .
[4] Neil J. Calkin. Dependent Sets of Constant Weight Binary Vectors , 1997, Comb. Probab. Comput..