Pages that link to "Item:Q2334438"
From MaRDI portal
The following pages link to Steiner systems \(S(2, 4, \frac{3^m-1}{2})\) and 2-designs from ternary linear codes of length \(\frac{3^m-1}{2}\) (Q2334438):
Displayed 16 items.
- A class of affine-invariant codes and their support 2-designs (Q2130038) (← links)
- A class of narrow-sense BCH codes over \(\mathbb{F}_q\) of length \(\frac{q^m-1}{2} \) (Q2291669) (← links)
- Combinatorial \(t\)-designs from quadratic functions (Q2302155) (← links)
- An infinite family of antiprimitive cyclic codes supporting Steiner systems \(S(3,8, 7^m+1)\) (Q2672291) (← links)
- Some \(t\)-designs from BCH codes (Q2673776) (← links)
- Infinite families of 2-designs from a class of affine-invariant codes (Q6089462) (← links)
- Infinite families of \(t\)-designs and strongly regular graphs from punctured codes (Q6112185) (← links)
- Steiner systems \(S(2,4, 2^m)\) supported by a family of extended cyclic codes (Q6112204) (← links)
- Some shortened codes from linear codes constructed by defining sets (Q6112207) (← links)
- Codes and pseudo-geometric designs from the ternary \(m\)-sequences with Welch-type decimation \(d = 2 \cdot 3^{(n -1)/2} + 1\) (Q6144448) (← links)
- Infinite families of 2‐designs derived from affine‐invariant codes (Q6146194) (← links)
- Some 3-designs and shortened codes from binary cyclic codes with three zeros (Q6156911) (← links)
- Constructions of cyclic codes and extended primitive cyclic codes with their applications (Q6156922) (← links)
- Infinite families of \(t\)-designs from the binomial \(x^4 +x^3\) over \(\mathrm{GF}(2^n)\) (Q6157857) (← links)
- New infinite families of near MDS codes holding \(t\)-designs (Q6172288) (← links)
- Infinite families of 2‐designs from a class of cyclic codes (Q6185557) (← links)
