On m-Near-Resolvable Block Designs and q-ary Constant-Weight Codes
| Autor: | Vladimir S. Lebedev, L. A. Bassalygo, Victor Zinoviev |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Computer Networks and Communications
020206 networking & telecommunications 02 engineering and technology Johnson bound Computer Science Applications Combinatorics 020303 mechanical engineering & transports Steiner system 0203 mechanical engineering Block (telecommunications) 0202 electrical engineering electronic engineering information engineering Equidistant Constant (mathematics) Information Systems Mathematics |
| Zdroj: | Problems of Information Transmission. 54:245-252 |
| ISSN: | 1608-3253 0032-9460 |
| DOI: | 10.1134/s0032946018030031 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink