Infinite Families of Linear Codes Supporting More t-Designs

From MaRDI portal
Publication:5088560

DOI10.1109/TIT.2022.3156072zbMATH Open1505.05027arXiv2106.10903MaRDI QIDQ5088560FDOQ5088560

Junling Zhou, Qianqian Yan

Publication date: 13 July 2022

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: Tang and Ding [IEEE IT 67 (2021) 244-254] studied the class of narrow-sense BCH codes mathcalC(q,q+1,4,1) and their dual codes with q=2m and established that the codewords of the minimum (or the second minimum) weight in these codes support infinite families of 4-designs or 3-designs. Motivated by this, we further investigate the codewords of the next adjacent weight in such codes and discover more infinite classes of t-designs with t=3,4. In particular, we prove that the codewords of weight 7 in mathcalC(q,q+1,4,1) support 4-designs when mgeqslant5 is odd and 3-designs when mgeqslant4 is even, which provide infinite classes of simple t-designs with new parameters. Another significant class of t-designs we produce in this paper has supplementary designs with parameters 4-(22s+1+1,5,5); these designs have the smallest index among all the known simple 4-(q+1,5,lambda) designs derived from codes for prime powers q; and they are further proved to be isomorphic to the 4-designs admitting the projective general linear group PGL(2,22s+1) as automorphism group constructed by Alltop in 1969.


Full work available at URL: https://arxiv.org/abs/2106.10903







Cited In (6)





This page was built for publication: Infinite Families of Linear Codes Supporting More t-Designs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088560)