Pages that link to "Item:Q1109009"
From MaRDI portal
The following pages link to On M.D.S. codes, arcs in PG(n,q) with q even, and a solution of three fundamental problems of B. Segre (Q1109009):
Displaying 22 items.
- Bent vectorial functions and linear codes from o-polynomials (Q499659) (← links)
- Some optimal codes from algebraic geometry and their covering radii (Q918506) (← links)
- On the maximality of linear codes (Q1035807) (← links)
- Polynomial multiplicities over finite fields and intersection sets (Q1186107) (← links)
- Complete \(k\)-arcs in PG(\(n,q\)), \(q\) even (Q1199637) (← links)
- M.D.S. codes and arcs in \(\mathrm{PG}(n,q)\) with \(q\) even: an improvement of the bounds of Bruen, Thas, and Blokhuis (Q1208044) (← links)
- On the covering radius of Reed-Solomon codes (Q1318799) (← links)
- Hyperplane sections of Grassmannians and the number of MDS linear codes (Q1604408) (← links)
- On the dual codes of skew constacyclic codes (Q1620965) (← links)
- Generalizing Erdős, Moon and Moser's result -- the number of \(k\)-dominating independent sets (Q1690033) (← links)
- Contributions by Aart Blokhuis to finite geometry, discrete mathematics, and combinatorics (Q2168066) (← links)
- Diagonal groups and arcs over groups (Q2168072) (← links)
- Linear cutting blocking sets and minimal codes in the rank metric (Q2169825) (← links)
- A construction for infinite families of semisymmetric graphs revealing their full automorphism group (Q2248574) (← links)
- Arcs and tensors (Q2285770) (← links)
- Maximal AMDS codes (Q2426953) (← links)
- The basics of bases (Q2431396) (← links)
- (6,3)-MDS codes over an alphabet of size 4 (Q2491256) (← links)
- Open problems in finite projective spaces (Q2512884) (← links)
- Maximum distance separable codes and arcs in projective spaces (Q2642024) (← links)
- On the Number of<i>k</i>-Dominating Independent Sets (Q2978192) (← links)
- The geometry of diagonal groups (Q5100015) (← links)
