Existence on splitting-balanced block designs with resolvability

DOI10.1007/S00373-017-1777-4MaRDI QIDQ2364419zbMATH OpenOpenAlexFDO

Authors K. Matsubara, Masanori Sawa, 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

zbMATH Keywords

balanced incomplete blockBIB designgroup divisible designnear-resolvabilityresolvabilitySBDsplitting-balanced block design

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05)

Recommendations

• Splitting balanced incomplete block designs with block size 2 5
• Splitting balanced incomplete block designs with block size 3 × 2
• scientific article; zbMATH DE number 2147946
• Further results on the existence of splitting BIBDs and application to authentication codes
• Combinatorial Constructions for Optimal Splitting Authentication Codes

Cites work

• An Improved Inequality for Balanced Incomplete Block Designs
• Combinatorial Constructions for Optimal Splitting Authentication Codes
• Further results on the existence of splitting BIBDs and application to authentication codes
• Generalized whist tournament designs
• scientific article; zbMATH DE number 52068 (Why is no real title available?)
• scientific article; zbMATH DE number 1109398 (Why is no real title available?)
• scientific article; zbMATH DE number 2147946 (Why is no real title available?)
• scientific article; zbMATH DE number 874490 (Why is no real title available?)
• scientific article; zbMATH DE number 3097793 (Why is no real title available?)
• Infinite families of optimal splitting authentication codes secure against spoofing attacks of higher order
• New combinatorial designs and their applications to authentication codes and secret sharing schemes.
• On a symmetric representation of Hermitian matrices and its applications to graph theory
• On the coexistence of conference matrices and near resolvable \(2\)-\((2k+1,k,k-1)\) designs.
• On the decomposition of K_n into complete m‐partite graphs
• Splitting balanced incomplete block designs with block size 3 × 2

Cited in

(2)

• Splitting balanced incomplete block designs with block size 2 5
• Decomposing complete graphs into isomorphic complete multipartite graphs

This page was built for publication: Existence on splitting-balanced block designs with resolvability

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