The Number of Linearly Independent Binary Vectors with Applications to the Construction of Hypercubes and Orthogonal Arrays,Pseudo (<Emphasis Type="Italic">t</Emphasis>, <Emphasis Type="Italic">m</Emphasis>, <Emphasis Type="Italic">s</Emphasis>)-Nets and Linear Codes |
| |
| Authors: | S B Damelin G Michalski G L Mullen D Stone |
| |
| Institution: | (1) Georgia Southern University, Statesboro, GA, USA;(2) The Pennsylvania State University, University Park, PA, USA |
| |
| 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  kn. Applications are given to the design of hypercubes and orthogonal arrays, pseudo (t, m, s)-nets and linear codes.This revised version was published online in October 2004 with a corrected Received date. |
| |
| Keywords: | 2000 Mathematics Subject Classification 11T30 05B15 |
| 本文献已被 SpringerLink 等数据库收录！ |
|
