Resolvability of block designs

DOI10.1214/AOS/1176343475MaRDI QIDQ1231912zbMATH OpenOpenAlexFDO

Authors Sanpei Kageyama

Publication date 1976

Published in The Annals of Statistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1214/aos/1176343475

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Combinatorial aspects of finite geometries (05B25) Statistical block designs (62K10)

Cited in

(11)

• Tactical decompositions of designs
• Inequality for equireplicated n-ary block designs with unequal block sizes
• The family of block designs with some combinatorial properties
• The family of t-designs. II
• On mu-resolvable BIB designs
• An extension method for balanced arrays
• Optimum chemical balance weighing designs for estimating the total weight
• New bound for affine resolvable designs and its application to authentication codes
• Tactical decomposable regular group divisible designs and their threshold schemes
• Almost perfect mutually unbiased bases that are sparse
• An updated table of two-associate-class triangular designs

This page was built for publication: Resolvability of block designs

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