位置：成果数据库 > 期刊 > 期刊详情页
可分解分裂BIBD的构作
  • 时间：0
  • 分类：O157.2[理学—数学;理学—基础数学]
  • 作者机构：[1]苏州大学数学科学学院,江苏苏州215006
  • 相关基金：Supported by the National Natural Science Foundation of China（ 10571133） and the Natural Science Foundation of jiangsu Province（03KJD110195）
作者： 梁淼[1]
关键词： 分裂BIBD, 可分解分裂BIBD, k-分裂认证码, splitting BIBD, resolvable splitting BIBD, k-sptitting A-code
中文摘要：

分裂平衡不完全区组设计（分裂BIBD）是Ogata，Kurosawa，Stinson和Saido最近为研究矗一分裂认证码的需要而引进的一类设计，用分裂BIBD构造的认证码在信息论的意义上是最优的．本文建立可分解分裂BIBD的一些构作方法．

英文摘要：

Splitting balanced incomplete block designs （splitting BIBDs） were first formulated by Ogata, Kurosawa, Stinson and Saido recently in the investigation of authentication codes. This note gives some constructions of resolvable splitting BIBDs.

同期刊论文项目
α-可分解设计和仿射可分解设计
期刊论文 23 会议论文 1
同项目期刊论文
On K1,k-factorization of bi- partite multigraphs
P4k-1-factorization of bi- partite multigraphs
Pk-factorization of symmetric complete bipartite digraphs
Splitting balanced incom- plete block designs with block size 2(4
P5-factorization of complete bipartite graphs
Embeddings ofα-resolvable Steiner triple systems
N(2N瓶颈指派问题及其阀门（threshold）算法
α-resolvable group divi- sible designs with block size four and group size three
Existence of resolvable optimal strong partially balanced designs
Resolvable optimal strong partially balanced designs with block size four
完全二部图存在路因子分解的Ushio猜想的证明
二部多重图的P4k-1-因子分解
The number of triangles in 2-factorizations
Three-fold Kirkman packing designs KPD3({4,s*},v)
二部多重图路因子分解的存在谱
The spectrum of path factori- zation of bipartite multi- graphs
α-resolvable group divi- sible designs with block size four and groups size six and nine
The proof of Ushio's con- jecture concerning path factorization of complete bipartite graphs
The existence of resolvable Mendelsohn designs RMD({4, s*},v)
Existence of optimal strong partially balanced designs
On K1,k-factorization of bipartite multigraphs
λKm,n的Pk-分解