Minimal 2-coverings of a finite affine space based on GF(2)

DOI10.1016/0378-3758(83)90053-8zbMath0529.05014OpenAlexW2046963004MaRDI QIDQ787145

Jagdish N. Srivastava

Publication date: 1983

Published in: Journal of Statistical Planning and Inference (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0378-3758(83)90053-8

zbMATH Keywords

zero-one matricesfactorial search designs

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Other designs, configurations (05B30) Combinatorial aspects of packing and covering (05B40)

Related Items (11)

Random and quasi-random designs in group testing ⋮ Probabilistic existence theorems in group testing ⋮ On the lower bound for the length of minimal codes ⋮ Locating and detecting arrays for interaction faults ⋮ An application of coding theory to estimating Davenport constants ⋮ An infinite series of resolution III.2 designs for the \(2^ m\) factorial experiment ⋮ Minimum number of runs for two-level factorial search designs ⋮ Nonadaptive group testing with lies: probabilistic existence theorems ⋮ Existence theorems for some group testing strategies ⋮ Linear binary codes with intersection properties ⋮ Linear intersecting codes

Cites Work

• New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimal 2-coverings of a finite affine space based on GF(2)