Some bounds for the number of blocks. III.

DOI10.1016/J.DISC.2016.03.020MaRDI QIDQ297934zbMATHOpenAlexFDO

Authors Etsuko Bannai, Ryuzaburo Noda

Publication date 20 June 2016

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1404.3821

zbMATH Keywords

\(\beta(i)\) design\(\beta(i)\) setdiameter perfect codeJohnson schemeperfect \(e\)-code

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Steiner systems in finite geometry (51E10) Other types of codes (94B60)

Abstract: Let $mathcalD=(Omega,mathcalB)$ be a pair of $v$ point set $Omega$ and a set $mathcalB$ consists of $k$ point subsets of $Omega$ which are called blocks. Let $d$ be the maximal cardinality of the intersections between the distinct two blocks in $mathcalB$. The triple $(v,k,d)$ is called the parameter of $mathcalB$. Let $b$ be the number of the blocks in $mathcalB$. It is shown that inequality $$ $$ holds for each $i$ satisfying $1leqileqk-d$, in the paper: Some Bounds for the Number of Blocks, Europ. J. Combinatorics 22 (2001), 91--94, by R. Noda. If $b$ achieves the upper bound, $mathcalD$ is called a $$ design. In the paper, an upper bound and a lower bound, $frac(d+2i)(k-d)ileqvleqfrac(d+2(i-1))(k-d)i-1$, for $v$ of a $$ design $mathcalD$ are given. In the present paper we consider the cases when $v$ does not achieve the upper bound or lower bound given above, and get new more strict bounds for $v$ respectively. We apply this bound to the problem of the perfect $e$-codes in the Johnson scheme, and improve the bound given by Roos in 1983.

Recommendations

• On blocking sets in a design
• Some bounds for the number of blocks
• Inequalities for quasisymmetric designs
• Block intersection numbers of block designs. II
• Some bounds for the number of blocks. II

Cites work

• scientific article; zbMATH DE number 3520420 (Why is no real title available?)
• scientific article; zbMATH DE number 2232233 (Why is no real title available?)
• A note on the existence of perfect constant weight codes
• Eine Charakterisierung des Steinersystems S(5,8,24)
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• On perfect codes and related concepts
• Perfect Constant-Weight Codes
• Some bounds for the number of blocks
• Some bounds for the number of blocks. II
• Some bounds for the number of blocks. III.
• The complete intersection theorem for systems of finite sets

Cited in

(2)

• Some bounds for the number of blocks
• Some bounds for the number of blocks. III.

This page was built for publication: Some bounds for the number of blocks. III.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q297934)