Steiner systems S(v, k, k − 1): Components and rank

Steiner systems S(v, k, k − 1): Components and rank 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 ≥ 5 arbitrary Steiner systems S(v, k, k − 1) and S(v, k, k − 2) have maximum possible 2-ranks. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Problems of Information Transmission Springer Journals

Steiner systems S(v, k, k − 1): Components and rank

Loading next page...
 
/lp/springer_journal/steiner-systems-s-v-k-k-1-components-and-rank-8jUWGn3xJW
Publisher
SP MAIK Nauka/Interperiodica
Copyright
Copyright © 2011 by Pleiades Publishing, Ltd.
Subject
Engineering; Communications Engineering, Networks; Systems Theory, Control; Information Storage and Retrieval; Electrical Engineering
ISSN
0032-9460
eISSN
1608-3253
D.O.I.
10.1134/S0032946011020050
Publisher site
See Article on Publisher Site

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 ≥ 5 arbitrary Steiner systems S(v, k, k − 1) and S(v, k, k − 2) have maximum possible 2-ranks.

Journal

Problems of Information TransmissionSpringer Journals

Published: Jul 14, 2011

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 12 million articles from more than
10,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Unlimited reading

Read as many articles as you need. Full articles with original layout, charts and figures. Read online, from anywhere.

Stay up to date

Keep up with your field with Personalized Recommendations and Follow Journals to get automatic updates.

Organize your research

It’s easy to organize your research with our built-in tools.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve Freelancer

DeepDyve Pro

Price
FREE
$49/month

$360/year
Save searches from Google Scholar, PubMed
Create lists to organize your research
Export lists, citations
Access to DeepDyve database
Abstract access only
Unlimited access to over
18 million full-text articles
Print
20 pages/month
PDF Discount
20% off