Codes with forbidden distances
From MaRDI portal
Publication:1970693
Cited in
(21)- New estimates in the problem of the number of edges in a hypergraph with forbidden intersections
- On threshold probability for the stability of independent sets in distance graphs
- New upper bounds for the independence numbers of graphs with vertices in \(\{-1,0,1\}^n\) and their applications to problems of the chromatic numbers of distance graphs
- On a Frankl-Wilson theorem
- Independence numbers of random subgraphs of a distance graph
- Diameters of random distance graphs
- Independence numbers of random subgraphs of distance graphs
- New upper bound for the chromatic number of a random subgraph of a distance graph
- New results on two hypercube coloring problems
- On the number of edges in induced subgraphs of a special distance graph
- A new estimate for the number of edges in induced subgraphs of a special distance graph
- New Turán type bounds for Johnson graphs
- Chromatic numbers of distance graphs with several forbidden distances and without cliques of a given size
- Bounds on distance distributions in codes of given size
- On the maximal number of edges in a uniform hypergraph with one forbidden intersection
- Estimates of the Number of Edges in Subgraphs of Johnson Graphs
- Maximum distance of anticodes
- Estimate of the number of edges in special subgraphs of a distance graph
- The number of edges in induced subgraphs of some distance graphs
- Codes with a disparity property
- On generalized Erdős-Ginzburg-Ziv constants for \(\mathbb{Z}_2^d\)
This page was built for publication: Codes with forbidden distances
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1970693)
