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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 277-288 |
| Number of pages | 12 |
| Journal | Monatshefte fur Mathematik |
| Volume | 141 |
| Issue number | 4 |
| DOIs | |
| State | Published - Apr 2004 |
All Science Journal Classification (ASJC) codes
- General Mathematics