TY - JOUR
T1 - T-Wise Balanced Designs from Binary Hamming Codes
AU - Manjusri Basu and Satya Bagchi
JO - Journal of Information and Computing Science
VL - 3
SP - 173
EP - 176
PY - 2024
DA - 2024/01
SN - 6
DO - http://doi.org/
UR - https://global-sci.org/intro/article_detail/jics/22675.html
KW - 
AB -  In &nbsp;this &nbsp;paper &nbsp;we &nbsp;show &nbsp;that &nbsp;the &nbsp;binary &nbsp;Hamming &nbsp;codes $(2^r-1, 2^{2^r-r-1}-2, 3)$&nbsp;satisfy&nbsp;<span style="text-wrap: wrap;">$(2^r-r-2) -2^{2^r-r-1}-1, \{3,4,...,2^r-4\}, 1)$&nbsp;designs, where $r\ge 3,$ a positive integer. For different
values of $r$ most of the $t$-wise balanced designs obtained from our constructions appear to be new.</span>