Enviar artigo por via de e-mail On m-Near-Resolvable Block Designs and q-ary Constant-Weight Codes
- Autores: Bassalygo L.A.1, Zinoviev V.A.1, Lebedev V.S.1
-
Afiliações:
- Kharkevich Institute for Information Transmission Problems
- Edição: Volume 54, Nº 3 (2018)
- Páginas: 245-252
- Seção: Coding Theory
- URL: https://journals.rcsi.science/0032-9460/article/view/166526
- DOI: https://doi.org/10.1134/S0032946018030031
- ID: 166526
Citar
Acesso aberto
Acesso está concedido
Somente assinantes
Resumo
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.
Sobre autores
L. Bassalygo
Kharkevich Institute for Information Transmission Problems
Autor responsável pela correspondência
Email: bass@iitp.ru
Rússia, Moscow
V. Zinoviev
Kharkevich Institute for Information Transmission Problems
Email: bass@iitp.ru
Rússia, Moscow
V. Lebedev
Kharkevich Institute for Information Transmission Problems
Email: bass@iitp.ru
Rússia, Moscow
Arquivos suplementares
