摘要
广义双可分解填充(GDRP)和常重复合码(CCC)存在着一一对应关系.本文给出了有关GDRP阶的一些新的上界.
It is known that there exists a one to one correspondence between generalized doubly resolvable packings(GDRPs) and constant composition codes(CCCs).It is given in this paper some new upper bounds of the value of v for which a GDRP of order v can exist.
出处
《苏州大学学报(自然科学版)》
CAS
2007年第2期11-13,共3页
Journal of Soochow University(Natural Science Edition)
基金
Supported by NSFC(10671140)
关键词
广义双可分解填充
常重复合码
界
Generalized doubly resolvable packings
constant composition codes
bounds