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

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.

Plum Print visual indicator of research metrics
PlumX Metrics
  • Citations
    • Citation Indexes: 9
  • Usage
    • Abstract Views: 44
  • Captures
    • Readers: 8
see details

Share

COinS