Some bounds for the number of blocks. III.

DOI10.1016/j.disc.2016.03.020zbMath1338.05018arXiv1404.3821OpenAlexW2411492237MaRDI QIDQ297934

Ryuzaburo Noda, Etsuko Bannai

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)

Related Items (1)

Some bounds for the number of blocks. III.

Cites Work

• Unnamed Item
• Unnamed Item
• Some bounds for the number of blocks. III.
• A note on the existence of perfect constant weight codes
• The complete intersection theorem for systems of finite sets
• Eine Charakterisierung des Steinersystems S(5,8,24)
• Some bounds for the number of blocks
• Some bounds for the number of blocks. II
• INTERSECTION THEOREMS FOR SYSTEMS OF FINITE SETS
• Perfect Constant-Weight Codes
• On perfect codes and related concepts

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