Problemy Peredachi Informatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Probl. Peredachi Inf.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Problemy Peredachi Informatsii, 2018, Volume 54, Issue 3, Pages 54–61 (Mi ppi2272)  
This article is cited in 4 scientific papers (total in 4 papers)

Coding Theory

On $m$-near-resolvable block designs and $q$-ary constant-weight codes

L. A. Bassalygo, V. A. Zinoviev, V. S. Lebedev

Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia
Full-text PDF (168 kB) Citations (4)
References:
PDF
HTML
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.
Funding agency Grant number
Russian Science Foundation 14-50-00150
The research was carried out at the Institute for Information Transmission Problems of the Russian Academy of Sciences at the expense of the Russian Science Foundation, project no. 14-50-00150.
Received: 08.12.2017
Revised: 09.04.2018
English version:
Problems of Information Transmission, 2018, Volume 54, Issue 3, Pages 245–252
DOI: https://doi.org/10.1134/S0032946018030031
Bibliographic databases:
Document Type: Article
UDC: 621.391.15
Language: Russian
Citation: L. A. Bassalygo, V. A. Zinoviev, V. S. Lebedev, “On $m$-near-resolvable block designs and $q$-ary constant-weight codes”, Probl. Peredachi Inf., 54:3 (2018), 54–61; Problems Inform. Transmission, 54:3 (2018), 245–252
Citation in format AMSBIB
\Bibitem{BasZinLeb18}
\by L.~A.~Bassalygo, V.~A.~Zinoviev, V.~S.~Lebedev
\paper On $m$-near-resolvable block designs and $q$-ary constant-weight codes
\jour Probl. Peredachi Inf.
\yr 2018
\vol 54
\issue 3
\pages 54--61
\mathnet{http://mi.mathnet.ru/ppi2272}
\elib{https://elibrary.ru/item.asp?id=38633733}
\transl
\jour Problems Inform. Transmission
\yr 2018
\vol 54
\issue 3
\pages 245--252
\crossref{https://doi.org/10.1134/S0032946018030031}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000448436900003}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85054809925}
Linking options:
  • https://www.mathnet.ru/eng/ppi2272
  • https://www.mathnet.ru/eng/ppi/v54/i3/p54
    • This publication is cited in the following 4 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Проблемы передачи информации Problems of Information Transmission
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024