Infinite families of 2-designs from a class of affine-invariant codes-Reference-Cited by-同舟云学术

Infinite families of 2-designs from a class of affine-invariant codes

Published:2022 Issue:0 Volume:0 Page:0
ISSN:1930-5346
Container-title:Advances in Mathematics of Communications
language:
Short-container-title:AMC

Author:

Liu Yan¹,Cao Xiwang²

Affiliation:

1. College of Mathematics and Physics, Yancheng Institute of Technology, Yancheng, 224003, China School of Mathematical Sciences, Nanjing University of Aeronautics and Astronautics, Nanjing, 210016, China

2. School of Mathematical Sciences, Nanjing University of Aeronautics and Astronautics, Nanjing, 210016, China Key Laboratory of Mathematical Modeling and, High Performance Computing of Air Vehicles(NUAA), MIIT, Nanjing, 210016, China

Abstract

<p style='text-indent:20px;'>In this paper, we first introduce a class of cyclic codes and their related linear codes which are affine-invariant. Then we obtain infinite families of 2-designs from the affine-invariant codes. And the parameters of the 2-designs are determined by considering the weight distribution of the linear codes.</p>

Publisher

American Institute of Mathematical Sciences (AIMS)

Subject

Applied Mathematics,Discrete Mathematics and Combinatorics,Computer Networks and Communications,Algebra and Number Theory,Applied Mathematics,Discrete Mathematics and Combinatorics,Computer Networks and Communications,Algebra and Number Theory

Reference32 articles.

1. E. F. Assmus Jr., J. D. Key., Designs and Their Codes, ${ref.volume} (1992).

2. E. F. Assmus Jr., H. F. Mattson Jr..New 5-designs, J. Comb. Theory, 6 (1969), 122-151.

3. E. Bannai, E. Bannai, S. Suda and H. Tanaka, On relative t-designs in polynomial association schemes, Electron. J. Comb., 22 (2015), Paper 4.47, 17 pp.

4. E. Cho, C. Ding, J. Hyun.A special characterisation of t-designs and its applications, Adv. Math. Commun., 13 (2019), 477-503.

5. S. Costa, T. Feng, X. Wang.New 2-designs from strong difference families, Finite Fields Appl., 50 (2018), 391-405.