Weakly Resolvable Block Designs and Nonbinary Codes Meeting the Johnson Bound

We present two new families of resolvable block designs. We introduce the notion of a weakly resolvable block design and prove the equivalence of such designs and nonbinary codes meeting the Johnson bound. We construct a new family of such codes.

Saved in:
Bibliographic Details
Published in:Problems of information transmission 2022-04, Vol.58 (1), p.1-12
Main Authors: Bassalygo, L. A., Zinoviev, V. A., Lebedev, V. S.
Format: Article
Language:English
Subjects:
639/301/1034/1035
639/925/357/995
Codes
Coding Theory
Communications Engineering
Control
Electrical Engineering
Engineering
Information Storage and Retrieval
Networks
Systems Theory
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present two new families of resolvable block designs. We introduce the notion of a weakly resolvable block design and prove the equivalence of such designs and nonbinary codes meeting the Johnson bound. We construct a new family of such codes.
ISSN:0032-9460
1608-3253
DOI:10.1134/S003294602201001X