Parameters of 2-Designs from Some BCH Codes
From MaRDI portal
Publication:5739027
DOI10.1007/978-3-319-55589-8_8zbMath1365.94555OpenAlexW2594377344MaRDI QIDQ5739027
Publication date: 1 June 2017
Published in: Codes, Cryptology and Information Security (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-55589-8_8
Related Items (6)
Infinite families of 3-designs from o-polynomials ⋮ A class of affine-invariant codes and their support 2-designs ⋮ Infinite families of 2-designs from a class of affine-invariant 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 ⋮ BCH cyclic codes
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exponential number of quasi-symmetric SDP designs and codes meeting the Grey-Rankin bound
- Codes and designs -- existence and uniqueness
- Quasi-symmetric designs, codes, quadrics, and hyperplane sections
- Designs in additive codes over GF(4)
- The automorphism groups of BCH codes and of some affine-invariant codes over extension fields
- A coding theoretic approach to extending designs
- Steiner systems \(S(2,4,v)\) -- a survey
- Infinite families of 2-designs and 3-designs from linear codes
- The dimension and minimum distance of two classes of primitive BCH codes
- The weight distribution of a class of linear codes from perfect nonlinear functions
- Fundamentals of Error-Correcting Codes
- Coding and Combinatorics
This page was built for publication: Parameters of 2-Designs from Some BCH Codes