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

Authors

• S. B. Damelin, Georgia Southern UniversityFollow
• Grzegorz J. Michalski, Georgia Southern UniversityFollow
• G. L. Mullen, The Pennsylvania State UniversityFollow
• D. Stone, Georgia Southern University

Document Type

Article

Publication Date

4-2004

Publication Title

Monatshefte fur Mathematik

DOI

10.1007/s00605-003-0044-3

ISSN

1436-5081

Abstract

We study formulae to count the number of binary vectors of length n that are linearly independent kat 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.

Recommended Citation

Damelin, S. B., Grzegorz J. Michalski, G. L. Mullen, D. Stone. 2004. "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." Monatshefte fur Mathematik, 141 (4): 277-288. doi: 10.1007/s00605-003-0044-3
https://digitalcommons.georgiasouthern.edu/math-sci-facpubs/7

Copyright

This work is archived and distributed under the repository's Standard Copyright and Reuse License (opens in new tab). End users may copy, store, and distribute this work without restriction. For all other uses, permission must be obtained from the copyright owners or their authorized agents.