论文信息 - The Number of Linearly Independent Binary Vectors with Applications to the Construction of Hypercubes and Orthogonal Arrays, Pseudo (t, m, s)-Nets and Linear Codes

The Number of Linearly Independent Binary Vectors with Applications to the Construction of Hypercubes and Orthogonal Arrays, Pseudo (t, m, s)-Nets and Linear Codes

Abstract.We study formulae to count the number of binary vectors of length n that are linearly independent k at a time where n and k are given positive integers with 1 ≤ k ≤ n. Applications are given to the design of hypercubes and orthogonal arrays, pseudo (t, m, s)-nets and linear codes.

[1] J. Hirschfeld. Surveys in Combinatorics: MAXIMUM SETS IN FINITE PROJECTIVE SPACES , 1983 .

[2] Gary L. Mullen,et al. Construction of digital ( t,m,s )-nets from linear codes , 1996 .

[3] Harald Niederreiter,et al. Updated tables of parameters of (T, M, S)‐nets , 1999 .

[4] W. Scott,et al. Group Theory. , 1964 .

[5] Gary L. Mullen,et al. An Equivalence between (T, M, S)-Nets and Strongly Orthogonal Hypercubes , 1996, J. Comb. Theory, Ser. A.

[6] H. Niederreiter. Point sets and sequences with small discrepancy , 1987 .

[7] Gary L. Mullen,et al. A hierarchy of complete orthogonal structures , 2002, Ars Comb..

[8] Rudolf Lide,et al. Finite fields , 1983 .

[9] Gary L. Mullen. Orthogonal hypercubes and related designs , 1998 .

[10] Stefan Kuhr,et al. Department of Mathematics and Computer Science , 2002 .

[11] Geoff Whittle,et al. Point sets with uniformity properties and orthogonal hypercubes , 1992 .