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, 2011, Volume 47, Issue 2, Pages 52–71 (Mi ppi2045)  

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

Coding Theory

Steiner systems $S(v,k,k-1)$: components and rank

V. A. Zinoviev, D. V. Zinoviev

Kharkevich Institute for Information Transmission Problems, Russian Academy of Sciences, Moscow
Full-text PDF (295 kB) Citations (5)
References:
Abstract: For an arbitrary Steiner system $S(v,k,t)$, we introduce the concept of a component as a subset of a system which can be transformed (changed by another subset) without losing the property for the resulting system to be a Steiner system $S(v,k,t)$. Thus, a component allows one to build new Steiner systems with the same parameters as an initial system. For an arbitrary Steiner system $S(v,k,k-1)$, we provide two recursive construction methods for infinite families of components (for both a fixed and growing k). Examples of such components are considered for Steiner triple systems $S(v,3,2)$ and Steiner quadruple systems $S(v,4,3)$. For such systems and for a special type of so-called normal components, we find a necessary and sufficient condition for the 2-rank of a system (i.e., its rank over $\mathbb F_2$) to grow under switching of a component. It is proved that for $k\ge5$ arbitrary Steiner systems $S(v,k,k-1)$ and $S(v,k,k-2)$ have maximum possible 2-ranks.
Received: 20.10.2009
Revised: 18.01.2011
English version:
Problems of Information Transmission, 2011, Volume 47, Issue 2, Pages 130–148
DOI: https://doi.org/10.1134/S0032946011020050
Bibliographic databases:
Document Type: Article
UDC: 621.391.1+519.7
Language: Russian
Citation: V. A. Zinoviev, D. V. Zinoviev, “Steiner systems $S(v,k,k-1)$: components and rank”, Probl. Peredachi Inf., 47:2 (2011), 52–71; Problems Inform. Transmission, 47:2 (2011), 130–148
Citation in format AMSBIB
\Bibitem{ZinZin11}
\by V.~A.~Zinoviev, D.~V.~Zinoviev
\paper Steiner systems $S(v,k,k-1)$: components and rank
\jour Probl. Peredachi Inf.
\yr 2011
\vol 47
\issue 2
\pages 52--71
\mathnet{http://mi.mathnet.ru/ppi2045}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2857787}
\transl
\jour Problems Inform. Transmission
\yr 2011
\vol 47
\issue 2
\pages 130--148
\crossref{https://doi.org/10.1134/S0032946011020050}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000299375200005}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-80051697526}
Linking options:
  • https://www.mathnet.ru/eng/ppi2045
  • https://www.mathnet.ru/eng/ppi/v47/i2/p52
  • This publication is cited in the following 5 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Проблемы передачи информации Problems of Information Transmission
    Statistics & downloads:
    Abstract page:550
    Full-text PDF :93
    References:59
    First page:11
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024