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, 2017, Volume 53, Issue 1, Pages 56–59 (Mi ppi2227)  

This article is cited in 10 scientific papers (total in 10 papers)

Coding Theory

Remark on balanced incomplete block designs, near-resolvable block designs, and $q$-ary constant-weight codes

L. A. Bassalygo, V. A. Zinoviev

Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow, Russia
References:
Abstract: We prove that any balanced incomplete block design $B(v, k, 1)$ generates a nearresolvable balanced incomplete block design $NRB(v, k-1, k-2)$. We establish a one-to-one correspondence between near-resolvable block designs $NRB(v, k-1, k-2)$ and the subclass of nonbinary (optimal, equidistant) constant-weight codes meeting the generalized Johnson bound.
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: 03.08.2016
English version:
Problems of Information Transmission, 2017, Volume 53, Issue 1, Pages 51–54
DOI: https://doi.org/10.1134/S0032946017010045
Bibliographic databases:
Document Type: Article
UDC: 621.391.15
Language: Russian
Citation: L. A. Bassalygo, V. A. Zinoviev, “Remark on balanced incomplete block designs, near-resolvable block designs, and $q$-ary constant-weight codes”, Probl. Peredachi Inf., 53:1 (2017), 56–59; Problems Inform. Transmission, 53:1 (2017), 51–54
Citation in format AMSBIB
\Bibitem{BasZin17}
\by L.~A.~Bassalygo, V.~A.~Zinoviev
\paper Remark on balanced incomplete block designs, near-resolvable block designs, and $q$-ary constant-weight codes
\jour Probl. Peredachi Inf.
\yr 2017
\vol 53
\issue 1
\pages 56--59
\mathnet{http://mi.mathnet.ru/ppi2227}
\elib{https://elibrary.ru/item.asp?id=28876247}
\transl
\jour Problems Inform. Transmission
\yr 2017
\vol 53
\issue 1
\pages 51--54
\crossref{https://doi.org/10.1134/S0032946017010045}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000399821500004}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85018516884}
Linking options:
  • https://www.mathnet.ru/eng/ppi2227
  • https://www.mathnet.ru/eng/ppi/v53/i1/p56
  • This publication is cited in the following 10 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, 2025