Answers are grounded in this paper and cite their sources.
Variable-weight geometric orthogonal codes (GOCs) were introduced by Doty and Winslow for designing the macrobonds in 3D DNA origami. Recently, Wang et al. introduced the concept of geometric difference families (GDFs) and established the equivalence between GOCs and a certain type of GDFs. Based on this relationship, Su et al. gave two classes of variable-weight GOCs. In this paper, we first prove the existence of (n× m, K, 1)-GDFs for K = \3, 5\ and \3, 6\. Furthermore, we settle all the cases left open by Su et al. for (n× m, \3, 4, 5\, 1)-GDFs. As a consequence, the perfect (n× m, K, 1)-GOCs for K = \3, 5\, \3, 6\ and \3, 4, 5\ are obtained.
No takes yet. Share an insight, caveat, or question.
Gao et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: