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

DOI10.1016/0378-3758(83)90053-8zbMATH Open0529.05014OpenAlexW2046963004MaRDI QIDQ787145FDOQ787145

Jagdish N. Srivastava, Gyula O. H. Katona

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)

Cites Work

• Title not available (Why is that?)
• New upper bounds on the rate of a code via the Delsarte-MacWilliams inequalities
• Title not available (Why is that?)

Cited In (11)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q787145)