On <Emphasis Type="Italic">m</Emphasis>-Near-Resolvable Block Designs and <Emphasis Type="Italic">q</Emphasis>-ary Constant-Weight Codes |
| |
| Authors: | L A Bassalygo V A Zinoviev V S Lebedev |
| |
| Affiliation: | 1.Kharkevich Institute for Information Transmission Problems,Russian Academy of Sciences,Moscow,Russia |
| |
| Abstract: | We introduce m-near-resolvable block designs. We establish a correspondence between such block designs and a subclass of (optimal equidistant) q-ary constant-weight codes meeting the Johnson bound. We present constructions of m-near-resolvable block designs, in particular based on Steiner systems and super-simple t-designs. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
