Email this article On m-Near-Resolvable Block Designs and q-ary Constant-Weight Codes
- Authors: Bassalygo L.A.1, Zinoviev V.A.1, Lebedev V.S.1
-
Affiliations:
- Kharkevich Institute for Information Transmission Problems
- Issue: Vol 54, No 3 (2018)
- Pages: 245-252
- Section: Coding Theory
- URL: https://journal-vniispk.ru/0032-9460/article/view/166526
- DOI: https://doi.org/10.1134/S0032946018030031
- ID: 166526
Cite item
Open Access
Access granted
Subscription Access
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.
About the authors
L. A. Bassalygo
Kharkevich Institute for Information Transmission Problems
Author for correspondence.
Email: bass@iitp.ru
Russian Federation, Moscow
V. A. Zinoviev
Kharkevich Institute for Information Transmission Problems
Email: bass@iitp.ru
Russian Federation, Moscow
V. S. Lebedev
Kharkevich Institute for Information Transmission Problems
Email: bass@iitp.ru
Russian Federation, Moscow
Supplementary files
