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-4zbMath0271.94006OpenAlexW2081069310MaRDI QIDQ758950
Publication date: 1973
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(73)90065-4
Combinatorial aspects of finite geometries (05B25) Theory of error-correcting codes and error-detecting codes (94B99)
Related Items (30)
Applications of cut polyhedra. II ⋮ Equidistant families of sets ⋮ Non-existence of a ternary constant weight \((16,5,15;2048)\) diameter perfect code ⋮ Multicolour Sunflowers ⋮ Unnamed Item ⋮ Hilbert bases of cuts ⋮ Lattice Points of Cut Cones ⋮ The complexity of binary matrix completion under diameter constraints ⋮ A note on equidistant subspace codes ⋮ Equidistant subspace codes ⋮ Galois geometries and coding theory ⋮ On large vector systems with equal scalar products ⋮ Every large set of equidistant (0,+1,-1)-vectors forms a sunflower ⋮ Asymptotic bounds on the equilateral dimension of hypercubes ⋮ Extension operations for cuts ⋮ Matrices dont deux lignes quelconque coincident dans un nombre donne de positions communes ⋮ Equidistant codes with distance 12 ⋮ On two conjectures of Stanton and Mullin ⋮ Bounds for equidistant codes and partial projective planes ⋮ Extremal \((r,\lambda)\)-designs ⋮ On the structure of regular pairwise balanced designs ⋮ On equidistant constant weight codes ⋮ Bounds on the Maximum Number of Vectors with given Scalar Products ⋮ A theorem on equidistant codes ⋮ Hypercube embedding of generalized bipartite metrics ⋮ Code pairs with specified parity of the Hamming distances ⋮ Equidistant codes in the Grassmannian ⋮ Cutting planes in combinatorics ⋮ \(\ell_ 1\)-rigid graphs ⋮ The chromatic index of simple hypergraphs
Cites Work
This page was built for publication: Une propriété extremale des plans projectifs finis dans une classe de codes équidistants
