广义 ( n×m,{ 3,5 },1 )完美差族及相关几何正交码  

Generalized ( n×m,{ 3,5 },1 ) Perfect Difference Families and Related Geometric Orthogonal Codes

作　　者：周丽娟 黄月梅[1,2] 

机构地区：[1]内蒙古师范大学数学科学学院,内蒙古 呼和浩特 [2]内蒙古自治区应用数学中心,内蒙古 呼和浩特

出　　处：《理论数学》2024年第7期15-22,共8页Pure Mathematics

摘　　要：DNA折纸技术在构造纳米材料中起着重要的作用。而几何正交码(GOCs)可以减少DNA折纸中宏键组的错位问题。本文通过确定(n,{3,5},1)完美差族的存在条件,并借助辅助设计与递归构造的方法,得到了广义(n×m,{3,5},1)完美差族的存在条件。又根据几何正交码与广义完美差族之间的等价关系,给出了对应的变重量的完美几何正交码的存在条件。DNA origami technology plays an important role in the construction of nanomaterials. Geometric Orthogonal Codes (GOCs) are used to design macro key groups in DNA origami to reduce its misalignment problems. In this paper, the existence conditions of generalized(n×m,{3,5},1)perfect difference families were determined with the aid of(n,{3,5},1)perfect difference families with auxiliary designs and recursive constructions. Then, the existence conditions of some variable-weight perfect geometric orthogonal codes were obtained from the equivalence relationship of geometric orthogonal codes and generalized perfect difference families.

关 键 词：广义完美差族 广义完美差填充 几何正交码 半完美可分组设计 

分 类 号：TP3[自动化与计算机技术—计算机科学与技术]