Une propriété extremale des plans projectifs finis dans une classe de codes équidistants
From MaRDI portal
Publication:758950
DOI10.1016/0012-365X(73)90065-4zbMATH Open0271.94006OpenAlexW2081069310MaRDI QIDQ758950FDOQ758950
Cites Work
Cited In (30)
- Equidistant subspace codes
- On two conjectures of Stanton and Mullin
- Code pairs with specified parity of the Hamming distances
- \(\ell_ 1\)-rigid graphs
- Extension operations for cuts
- Multicolour sunflowers
- Applications of cut polyhedra. II
- Every large set of equidistant (0,+1,-1)-vectors forms a sunflower
- Cutting planes in combinatorics
- The chromatic index of simple hypergraphs
- On large vector systems with equal scalar products
- Non-existence of a ternary constant weight \((16,5,15;2048)\) diameter perfect code
- Equidistant families of sets
- A note on equidistant subspace codes
- Extremal \((r,\lambda)\)-designs
- On the structure of regular pairwise balanced designs
- Matrices dont deux lignes quelconque coincident dans un nombre donne de positions communes
- Galois geometries and coding theory
- Bounds on the Maximum Number of Vectors with given Scalar Products
- Hypercube embedding of generalized bipartite metrics
- Bounds for equidistant codes and partial projective planes
- Hilbert bases of cuts
- Asymptotic bounds on the equilateral dimension of hypercubes
- Equidistant codes in the Grassmannian
- A theorem on equidistant codes
- The complexity of binary matrix completion under diameter constraints
- Equidistant codes with distance 12
- On equidistant constant weight codes
- On equidistant constant weight codes
- Lattice Points of Cut Cones
This page was built for publication: Une propriété extremale des plans projectifs finis dans une classe de codes équidistants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q758950)
