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

被引：8

作者：

Damelin, SB

Michalski, G

Mullen, GL

Stone, D

机构：

[1] Georgia So Univ, Dept Math & Comp Sci, Statesboro, GA 30460 USA

[2] Penn State Univ, Dept Math, University Pk, PA 16802 USA

来源：

MONATSHEFTE FUR MATHEMATIK | 2004年 / 141卷 / 04期

关键词：

binary vector; linear code; linear independence; (t; m; s)-net; pseudo; orthogonal array; hypercube; orthogonal structure;

D O I：

10.1007/s00605-003-0044-3

中图分类号：

O1 [数学];

学科分类号：

0701 [数学]; 070101 [基础数学];

摘要：

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 less than or equal to k less than or equal to n. Applications are given to the design of hypercubes and orthogonal arrays, pseudo (t, m, s)-nets and linear codes.

引用

页码：277 / 288

页数：12

共 14 条

[1]

Bose RC, 1938, SANKHYA, V3, P323

[2]

Clayman AT, 1999, J COMB DES, V7, P381, DOI 10.1002/(SICI)1520-6610(1999)7:5<381::AID-JCD7>3.0.CO

[3]

2-S

[4]

HIRSCHFELD JWP, 1983, SURVEYS COMBINATORIE, P55

[5]

LAWRENCE KM, 1995, THESIS U WISCONSIN

[6]

LAWRENCE KM, 1996, FUNITE FIELDS APPL, P189

[7]

Laywine CF, 2002, ARS COMBINATORIA, V63, P75

[8]

Lidl R., 1997, Finite Fields

[9]

Orthogonal hypercubes and related designs [J].

Mullen, GL .

JOURNAL OF STATISTICAL PLANNING AND INFERENCE, 1998, 73 (1-2) :177-188

[10]

POINT SETS WITH UNIFORMITY PROPERTIES AND ORTHOGONAL HYPERCUBES [J].

MULLEN, GL ;

WHITTLE, G .

MONATSHEFTE FUR MATHEMATIK, 1992, 113 (04) :265-273

← 1 2 →