English

Some $3$-designs and shortened codes from binary cyclic codes with three zeros

Information Theory 2022-11-28 v2 math.IT

Abstract

Linear codes and tt-designs are interactive with each other. It is well known that some tt-designs have been constructed by using certain linear codes in recent years. However, only a small number of infinite families of the extended codes of linear codes holding an infinite family of tt-designs with t3t\geq 3 are reported in the literature. In this paper, we study the extended codes of the augmented codes of a class of binary cyclic codes with three zeros and their dual codes, and show that those codes hold 33-designs. Furthermore, we obtain some shortened codes from the studied cyclic codes and explicitly determine their parameters. Some of those shortened codes are optimal or almost optimal.

Keywords

Cite

@article{arxiv.2206.15153,
  title  = {Some $3$-designs and shortened codes from binary cyclic codes with three zeros},
  author = {Can Xiang and Chunming Tang},
  journal= {arXiv preprint arXiv:2206.15153},
  year   = {2022}
}

Comments

20 pages. arXiv admin note: text overlap with arXiv:2110.03881, arXiv:2007.05923

R2 v1 2026-06-24T12:09:25.513Z