Infinite families of 2‐designs from a class of cyclic codes
From MaRDI portal
Publication:6185557
DOI10.1002/jcd.21682arXiv1904.04242OpenAlexW2991466664WikidataQ126659321 ScholiaQ126659321MaRDI QIDQ6185557
Xiaoni Du, Rong Wang, Cui Ling Fan
Publication date: 29 January 2024
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.04242
Related Items (6)
Infinite families of 2-designs from a class of non-binary Kasami cyclic codes ⋮ Infinite families of 2-designs from a class of affine-invariant codes ⋮ Infinite families of \(t\)-designs and strongly regular graphs from punctured codes ⋮ The projective general linear group \(\mathrm{PGL}(2, 5^m)\) and linear codes of length \(5^m+1\) ⋮ The projective general linear group \(\mathrm{PGL}(2,2^m)\) and linear codes of length \(2^m+1\) ⋮ Linear codes from support designs of ternary cyclic codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Steiner systems \(S(2,4,v)\) -- a survey
- Infinite families of 2-designs and 3-designs from linear codes
- Steiner systems \(S(2, 4, \frac{3^m-1}{2})\) and 2-designs from ternary linear codes of length \(\frac{3^m-1}{2}\)
- Infinite families of 3-designs from a type of five-weight code
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
- Further evaluations of Weil sums
- Explicit evaluations of some Weil sums
- Fundamentals of Error-Correcting Codes
- Some results on cyclic codes which are invariant under the affine group and their applications
This page was built for publication: Infinite families of 2‐designs from a class of cyclic codes