We prove that any balanced incomplete block design B(v, k, 1) generates a nearresolvable balanced incomplete block design NRB(v, k − 1, k − 2). We establish a one-to-one correspondence between near-resolvable block designs NRB(v, k −1, k −2) and the subclass of nonbinary (optimal, equidistant) constant-weight codes meeting the generalized Johnson bound.
Problems of Information Transmission – Springer Journals
Published: Apr 23, 2017
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud