Geometric difference families and related variable-weight geometric orthogonal codes

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\times 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\times m, \{3, 4, 5\}, 1) $-GDFs. As a consequence, the perfect $ (n\times m, K, 1) $-GOCs for $ K = \{3, 5\} $, $ \{3, 6\} $ and $ \{3, 4, 5\} $ are obtained.

Authors

Institutions

Publication Details

Journal
Advances in Mathematics of Communications
Published
2026-11-18
DOI
https://doi.org/10.3934/amc.2026.101099
Primary Topic
Coding theory and cryptography
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Geometric difference families and related variable-weight geometric orthogonal codes

Xiaowei Su, 田子红, Yichen Bai, Huizhen Gao
1 links
Advances in Mathematics of Communications
Coding theory and cryptography
article

Geometric difference families and related variable-weight geometric orthogonal codes

Xiaowei Su, 田子红, Yichen Bai, Huizhen Gao
article en

Abstract

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\times 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\times m, \{3, 4, 5\}, 1) $-GDFs. As a consequence, the perfect $ (n\times m, K, 1) $-GOCs for $ K = \{3, 5\} $, $ \{3, 6\} $ and $ \{3, 4, 5\} $ are obtained.

Advances in Mathematics of CommunicationsVol. 27(0)
Beijing Institute of Education (CN), Beijing Institute of Economics and Management (CN), Hebei Normal University (CN)
Hebei Normal University, Natural Science Foundation of Hebei Province, Division of Mathematical Sciences
Coding theory and cryptography
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon