位置：成果数据库 > 期刊 > 期刊详情页
A new proof of a Colbourn-Rosa problem
  • 期刊名称：Discrete Mathematics
  • 时间：0
  • 作者或编辑：3448
  • 第一作者所属机构：苏州大学
  • 页码：261 (2003), 451- - 458
  • 语言：英文
  • 相关项目：某些分组码和密码方案的组合结构研究
作者： J. Yin|
同期刊论文项目
某些分组码和密码方案的组合结构研究
期刊论文 17 会议论文 5
同项目期刊论文
A combinatorial construction for perfect deletion-correcting codes
Packing designs with equal-sized holes
Constructions for optimal (v, 4, 1) optical orthogonal codes
Optimal (9v, 4, 1) optical orthogonal codes
Directed packing and covering designs with block size four
Directed B(K, 1; v) with K={4,5} and {4,6} related to deletion/insertion correcting codes
A survey on maximum distance holey packings
A general construction for optimal cyclic packing designs
The combinatorial construction of a class of optimal optical orthogonal codes
一类最优光正交码的组合构作
Packing of K_v with certain graphs of five vertices
Existence of perfect 4-correcting codes with length six
Constructions of Difference Covering Arrays
Further results on optimal optical orthogonal codes with weight
Constructions of uniform designs by using resolvable packings and coverings
平衡型与BP-最优设计