Efficiency of connected binary block designs when a single observation is unavailable
From MaRDI portal
Publication:1205805
zbMath0781.62122MaRDI QIDQ1205805
Subir Ghosh, Rahul Mukerjee, Sanpei Kageyama
Publication date: 1 April 1993
Published in: Annals of the Institute of Statistical Mathematics (Search for Journal in Brave)
boundsbalanced incomplete block designdesign efficiencyconnected binary block designexplicit expressions of efficiencyregular group divisible designunavailable observation
Related Items (6)
Robustness to the unavailability of data in block designs ⋮ Type-V intermittency from Markov binary block visibility graph perspective ⋮ Robustness of balanced incomplete block designs to randomly missing observations ⋮ Type-II intermittency from Markov binary block visibility graph perspective ⋮ Type-I intermittency from Markov binary block visibility graph perspective ⋮ Missing observations in Youden square designs
This page was built for publication: Efficiency of connected binary block designs when a single observation is unavailable