A coding theoretic approach to extending designs
From MaRDI portal
Publication:1896352
DOI10.1016/0012-365X(94)00010-GzbMath0834.05006WikidataQ127830110 ScholiaQ127830110MaRDI QIDQ1896352
George T. Kennedy, Vera S. Pless
Publication date: 31 March 1996
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (13)
The linear codes of \(t\)-designs held in the Reed-Muller and simplex codes ⋮ Infinite families of 2-designs from linear codes ⋮ Infinite families of 3-designs from a type of five-weight code ⋮ Steiner systems \(S(2,4, 2^m)\) supported by a family of extended cyclic codes ⋮ Infinite families of \(t\)-designs from the binomial \(x^4 +x^3\) over \(\mathrm{GF}(2^n)\) ⋮ Some new results on the self-dual \([120,60,24\) code] ⋮ Infinite Families of 2-Designs from a Class of Linear Codes Related to Dembowski-Ostrom Functions ⋮ Parameters of 2-Designs from Some BCH Codes ⋮ On the classification and enumeration of self-dual codes ⋮ Combinatorial \(t\)-designs from quadratic functions ⋮ The existence of a self-dual \([70 ,35 ,12\) code and formally self-dual codes.] ⋮ Linear codes of 2-designs associated with subcodes of the ternary generalized Reed-Muller codes ⋮ Infinite families of 2-designs from two classes of binary cyclic codes with three nonzeros
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the enumeration of self-dual codes
- New uniqueness proofs for the (5,8,24), (5,6,12) and related Steiner systems
- Orphan structure of the first-order Reed--Muller codes
- On designs and formally self-dual codes
- An infinite class of 5-designs
- A new upper bound on the minimal distance of self-dual codes
- Weight enumerators of self-dual codes
- Orphans of the first order Reed-Muller codes
- Generalized quadratic residue codes
- On the coveting radius of extremal self-dual codes
This page was built for publication: A coding theoretic approach to extending designs
