A class of \(q\)-ary codes (Q1318844)

Nested balanced incomplete block designs were introduced by \textit{D. A. Preece} [Biometrika 54, 479-480 (1967)]. \textit{J. Seberry} and \textit{C. Mackenzie} [Ars. Comb. 26B, 37-50 (1988; Zbl 0667.94009)] gave a \(q\)-ary analogue of Plotkin's bound and methods of constructing \(q\)-ary codes. Here, a method of construction of \(q\)-ary \((q\geq 3)\) codes from nested BIB designs is given. The following is proved: Theorem 1. The existence of a cyclic solution of a nested BIB design with parameters \(v\), \(r\); \(b_ 1\), \(k_ 1\), \(\lambda_ 1\); \(b_ 2\), \(k_ 2\), \(\lambda_ 2\), and \(k_ 1/k_ 2= q-1\) implies the existence of \(q\)-ary codes: (i) \((v,v,2k_ 1- \lambda_ 1- \lambda_ 2)\), (ii) \((v,v+q-1, \min\{2k_ 1- \lambda_ 1- \lambda_ 2, v-k_ 2\})\), (iii) \((v,v+q, \min\{2k_ 1- \lambda_ 1-\lambda_ 2, k_ 1, v-k_ 2\})\).