Infinite families of 2-designs from linear codes
From MaRDI portal
Publication:2140830
DOI10.1007/s00200-020-00438-8OpenAlexW3038078395MaRDI QIDQ2140830
Xiaoni Du, Qi Wang, Rong Wang, Chun-Ming Tang
Publication date: 23 May 2022
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00200-020-00438-8
Combinatorial aspects of block designs (05B05) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Linear codes (general theory) (94B05)
Related Items (6)
Infinite families of 2-designs from a class of affine-invariant codes ⋮ Infinite families of \(t\)-designs and strongly regular graphs from punctured codes ⋮ Steiner systems \(S(2,4, 2^m)\) supported by a family of extended cyclic codes ⋮ Infinite families of 2‐designs derived from affine‐invariant codes ⋮ New infinite families of near MDS codes holding \(t\)-designs ⋮ Linear codes from support designs of ternary cyclic codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Designs in additive codes over GF(4)
- A coding theoretic approach to extending designs
- Hasse-Davenport curves, Gauss sums, and weight distributions of irreducible cyclic codes
- Steiner systems \(S(2,4,v)\) -- a survey
- Infinite families of 2-designs and 3-designs from linear codes
- Combinatorial \(t\)-designs from quadratic functions
- Infinite families of 3-designs from a type of five-weight code
- Weight distribution of some reducible cyclic codes
- Sums of Gauss sums and weights of irreducible codes
- A Class of Two-Weight and Three-Weight Codes and Their Applications in Secret Sharing
- Fundamentals of Error-Correcting Codes
- Further evaluations of Weil sums
- Designs from Linear 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 linear codes
