Infinite Families of Linear Codes Supporting More t-Designs
From MaRDI portal
Publication:5088560
DOI10.1109/TIT.2022.3156072zbMATH Open1505.05027arXiv2106.10903MaRDI QIDQ5088560FDOQ5088560
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 and their dual codes with 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 -designs with . In particular, we prove that the codewords of weight in support -designs when is odd and -designs when is even, which provide infinite classes of simple -designs with new parameters. Another significant class of -designs we produce in this paper has supplementary designs with parameters 4-; these designs have the smallest index among all the known simple 4- designs derived from codes for prime powers ; and they are further proved to be isomorphic to the 4-designs admitting the projective general linear group PGL as automorphism group constructed by Alltop in 1969.
Full work available at URL: https://arxiv.org/abs/2106.10903
Cited In (6)
- On binary linear codes supporting t-designs
- New infinite families of near MDS codes holding \(t\)-designs
- The linear codes of \(t\)-designs held in the Reed-Muller and simplex codes
- New support 5-designs from lifted linear codes
- Infinite families of 3-designs from special symmetric polynomials
- Infinite families of 2-designs from two classes of binary cyclic codes with three nonzeros
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)