Back to Search
Start Over
On m-Near-Resolvable Block Designs and q-ary Constant-Weight Codes.
- Source :
- Problems of Information Transmission; Jul2018, Vol. 54 Issue 3, p245-252, 8p
- Publication Year :
- 2018
-
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. [ABSTRACT FROM AUTHOR]
- Subjects :
- STEINER systems
BLOCK designs
BINARY codes
PERMUTATIONS
MATHEMATICAL proofs
Subjects
Details
- Language :
- English
- ISSN :
- 00329460
- Volume :
- 54
- Issue :
- 3
- Database :
- Complementary Index
- Journal :
- Problems of Information Transmission
- Publication Type :
- Academic Journal
- Accession number :
- 132372394
- Full Text :
- https://doi.org/10.1134/S0032946018030031