|
|
Problemy Peredachi Informatsii, 2017, Volume 53, Issue 1, Pages 56–59
(Mi ppi2227)
|
|
|
|
This article is cited in 10 scientific papers (total in 10 papers)
Coding Theory
Remark on balanced incomplete block designs, near-resolvable block designs, and $q$-ary constant-weight codes
L. A. Bassalygo, V. A. Zinoviev Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia
Abstract:
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.
Received: 03.08.2016
Citation:
L. A. Bassalygo, V. A. Zinoviev, “Remark on balanced incomplete block designs, near-resolvable block designs, and $q$-ary constant-weight codes”, Probl. Peredachi Inf., 53:1 (2017), 56–59; Problems Inform. Transmission, 53:1 (2017), 51–54
Linking options:
https://www.mathnet.ru/eng/ppi2227 https://www.mathnet.ru/eng/ppi/v53/i1/p56
|
|