INFINITE FAMILIES OF t-DESIGNS AND STRONGLY REGULAR GRAPHS FROM PUNCTURED CODES

被引：1

作者：

Heng, Ziling ^{[1
]}

Li, Dexiang ^{[1
]}

Liu, Fenjin ^{[1
]}

Wang, Weiqiong ^{[1
]}

机构：

[1] Changan Univ, Sch Sci, Xian 710064, Peoples R China

来源：

ADVANCES IN MATHEMATICS OF COMMUNICATIONS | 2022年 / 16卷 / 04期

基金：

中国国家自然科学基金;

关键词：

Combinatorial design; linear code; strongly regular graph; LINEAR CODES; 2-WEIGHT; 3-DESIGNS;

D O I：

10.3934/amc.2022043

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

The puncturing technique is sometimes efficient in constructing projective codes from original codes which are not projective. In this paper, several families of projective linear codes punctured from reducible cyclic codes, special linear codes or irreducible cyclic codes are investigated. The parameters and weight enumerators of the punctured codes and their duals are explicitly determined. Some of the codes are optimal and some of the codes are self-orthogonal which can be used to construct quantum codes. Several infinite families of combinatorial 2-designs and 3-designs including some families of Steiner systems are constructed from the punctured codes and their duals. Besides, infinite families of strongly regular graphs are also derived from some families of two-weight projective codes.

引用

页码：753 / 778

页数：26

共 38 条

[1]

ASSMUS EF, 1974, SIAM REV, V16, P349, DOI 10.1137/1016056

[2] Projective two-weight codes with small parameters and their corresponding graphs [J].