Infinite families of \(t\)-designs and strongly regular graphs from punctured codes
From MaRDI portal
Publication:6112185
DOI10.3934/amc.2022043zbMath1530.94055OpenAlexW4285154526MaRDI QIDQ6112185
Weiqiong Wang, Dexiang Li, Fenjin Liu, Ziling Heng
Publication date: 7 July 2023
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2022043
Cites Work
- Unnamed Item
- Unnamed Item
- Complete weight enumerators of some linear codes and their applications
- Linear codes with two or three weights from quadratic bent functions
- Weight distributions of cyclic codes with respect to pairwise coprime order elements
- Linear codes with few weights from weakly regular bent functions based on a generic construction
- Complete weight distributions of two classes of cyclic codes
- Projective two-weight codes with small parameters and their corresponding graphs
- Quasi-symmetric designs and codes meeting the Grey-Rankin bound
- Another generalisation of the binary Reed-Muller codes and its applications
- Minimal linear codes over finite fields
- Cyclotomic trace codes
- Infinite families of 2-designs and 3-designs from linear codes
- Combinatorial \(t\)-designs from special functions
- Infinite families of 2-designs from two classes of binary cyclic codes with three nonzeros
- Infinite families of 2-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}\)
- A construction of \(q\)-ary linear codes with two weights
- Infinite families of 3-designs from a type of five-weight code
- Weight distribution of some reducible cyclic codes
- A class of three-weight cyclic codes
- Linear Codes With Two or Three Weights From Weakly Regular Bent Functions
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
- Linear Codes From Perfect Nonlinear Mappings and Their Secret Sharing Schemes
- Nonbinary Stabilizer Codes Over Finite Fields
- Cyclotomic Linear Codes of Order $3$
- Fundamentals of Error-Correcting Codes
- The Geometry of Two-Weight Codes
- An Infinite Family of Steiner Systems from Cyclic Codes
- Designs from Linear Codes
- Codes, Differentially $\delta$ -Uniform Functions, and $t$ -Designs
- Infinite Families of Near MDS Codes Holding t-Designs
- An Infinite Family of Linear Codes Supporting 4-Designs
- Bent Vectorial Functions, Codes and Designs
- A Bound for Error-Correcting Codes
- Coding and Combinatorics
- Infinite families of 2‐designs from a class of cyclic codes
