Infinite families of 2‐designs derived from affine‐invariant codes
From MaRDI portal
Publication:6146194
DOI10.1002/JCD.21796OpenAlexW3174118128MaRDI QIDQ6146194
Publication date: 5 February 2024
Published in: Journal of Combinatorial Designs (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jcd.21796
Combinatorial aspects of block designs (05B05) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05) Steiner systems in finite geometry (51E10) Cyclic codes (94B15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A class of five-weight cyclic codes and their weight distribution
- Optimal \(p\)-ary cyclic codes with minimum distance four from monomials
- Infinite families of 2-designs from a class of non-binary Kasami cyclic codes
- Infinite families of 2-designs and 3-designs from linear codes
- Combinatorial \(t\)-designs from special functions
- Infinite families of 2-designs from linear codes
- The number of the non-full-rank Steiner quadruple systems \(S ( v , 4 , 3 )\)
- On the number of resolvable Steiner triple systems of small 3-rank
- 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
- Weight distribution of some reducible cyclic codes
- On subfield subcodes of modified Reed-Solomon codes (Corresp.)
- An Infinite Family of Steiner Systems from Cyclic Codes
- Codes, Differentially $\delta$ -Uniform Functions, and $t$ -Designs
- An Infinite Family of Linear Codes Supporting 4-Designs
- The number of the non‐full‐rank Steiner triple systems
- Some results on cyclic codes which are invariant under the affine group and their applications
- New 5-designs
- Parameters of 2-Designs from Some BCH Codes
This page was built for publication: Infinite families of 2‐designs derived from affine‐invariant codes
