A class of affine-invariant codes and their support 2-designs
From MaRDI portal
Publication:2130038
DOI10.1007/s12095-021-00506-xzbMath1484.05024OpenAlexW3173577308MaRDI QIDQ2130038
Publication date: 25 April 2022
Published in: Cryptography and Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12095-021-00506-x
Combinatorial aspects of block designs (05B05) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Steiner systems in finite geometry (51E10) Cyclic codes (94B15)
Cites Work
- 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
- Infinite families of 2-designs from two classes of binary cyclic codes with three nonzeros
- 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
- On the Weight Distributions of Two Classes of Cyclic Codes
- On subfield subcodes of modified Reed-Solomon codes (Corresp.)
- 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
- A Family of Five-Weight Cyclic Codes and Their Weight Enumerators
- 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
- The weight distribution of a family of \(p\)-ary cyclic codes
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A class of affine-invariant codes and their support 2-designs
