Existence on splitting-balanced block designs with resolvability
From MaRDI portal
Publication:2364419
DOI10.1007/s00373-017-1777-4zbMath1366.05014OpenAlexW2606430756MaRDI QIDQ2364419
Masanori Sawa, Kazuki Matsubara, Sanpei Kageyama
Publication date: 20 July 2017
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-017-1777-4
group divisible designBIB designresolvabilitybalanced incomplete blocknear-resolvabilitySBDsplitting-balanced block design
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Infinite families of optimal splitting authentication codes secure against spoofing attacks of higher order
- On a symmetric representation of Hermitian matrices and its applications to graph theory
- Further results on the existence of splitting BIBDs and application to authentication codes
- Generalized whist tournament designs
- New combinatorial designs and their applications to authentication codes and secret sharing schemes.
- On the coexistence of conference matrices and near resolvable \(2\)-\((2k+1,k,k-1)\) designs.
- On the decomposition of Kn into complete m‐partite graphs
- Splitting balanced incomplete block designs with block size 3 × 2
- Combinatorial Constructions for Optimal Splitting Authentication Codes
- An Improved Inequality for Balanced Incomplete Block Designs
This page was built for publication: Existence on splitting-balanced block designs with resolvability