首页 | 本学科首页   官方微博 | 高级检索  
     检索      


4‐*GDD(6n)s and Related Optimal Quaternary Constant‐Weight Codes
Authors:Mingzhi Zhu  Gennian Ge
Abstract:Constant‐weight codes (CWCs) have played an important role in coding theory. To construct CWCs, a K‐GDD (where GDD is group divisible design) with the “star” property, denoted by K‐*GDD, was introduced, in which any two intersecting blocks intersect in at most two common groups. In this paper, we consider the existence of 4‐*GDDurn:x-wiley:10638539:jcd21304:equation:jcd21304-math-0001s. Previously, the necessary conditions for existence were shown to be sufficient for urn:x-wiley:10638539:jcd21304:equation:jcd21304-math-0002, and also sufficient for urn:x-wiley:10638539:jcd21304:equation:jcd21304-math-0003 with prime powers urn:x-wiley:10638539:jcd21304:equation:jcd21304-math-0004 and urn:x-wiley:10638539:jcd21304:equation:jcd21304-math-0005. We continue to investigate the existence of 4‐*GDD(6n)s and show that the necessary condition for the existence of a 4‐*GDD(6n), namely, urn:x-wiley:10638539:jcd21304:equation:jcd21304-math-0006, is also sufficient. The known results on the existence of optimal quaternary (n, 5, 4) CWCs are also extended.
Keywords:4‐*GDDs  generalized Steiner systems  constant-weight codes  Room squares
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号