@Article{JICS-6-3,
author = {},
title = {T-Wise Balanced Designs from Binary Hamming Codes},
journal = {Journal of Information and Computing Science},
year = {2011},
volume = {6},
number = {3},
pages = {173--176},
abstract = { 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>},
issn = {1746-7659},
doi = {https://doi.org/2024-JICS-22675},
url = {https://global-sci.com/article/87407/t-wise-balanced-designs-from-binary-hamming-codes}
}